./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash caa84a091b99b66a1da3990b205ee8e8e4cfa2478d32b035bf8784a52ef5640a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 04:01:23,436 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 04:01:23,508 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-24 04:01:23,516 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 04:01:23,516 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 04:01:23,545 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 04:01:23,545 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 04:01:23,546 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 04:01:23,546 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 04:01:23,547 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 04:01:23,547 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 04:01:23,547 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 04:01:23,548 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 04:01:23,548 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 04:01:23,548 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 04:01:23,548 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 04:01:23,549 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 04:01:23,549 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 04:01:23,549 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 04:01:23,549 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 04:01:23,549 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 04:01:23,550 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 04:01:23,550 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 04:01:23,551 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 04:01:23,551 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 04:01:23,551 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 04:01:23,551 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 04:01:23,552 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 04:01:23,552 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 04:01:23,552 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 04:01:23,552 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 04:01:23,552 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 04:01:23,553 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 04:01:23,553 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 04:01:23,553 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 04:01:23,553 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 04:01:23,554 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 04:01:23,554 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 04:01:23,554 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 04:01:23,554 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> caa84a091b99b66a1da3990b205ee8e8e4cfa2478d32b035bf8784a52ef5640a [2024-10-24 04:01:23,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 04:01:23,809 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 04:01:23,812 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 04:01:23,813 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 04:01:23,814 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 04:01:23,815 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v1.c [2024-10-24 04:01:25,228 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 04:01:25,412 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 04:01:25,412 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v1.c [2024-10-24 04:01:25,424 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50709d09d/6269313c5052448da02dfa06dd9c57f3/FLAGb61064c6c [2024-10-24 04:01:25,436 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50709d09d/6269313c5052448da02dfa06dd9c57f3 [2024-10-24 04:01:25,439 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 04:01:25,441 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 04:01:25,441 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 04:01:25,442 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 04:01:25,446 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 04:01:25,446 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:01:25" (1/1) ... [2024-10-24 04:01:25,447 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f71f81f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:25, skipping insertion in model container [2024-10-24 04:01:25,447 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:01:25" (1/1) ... [2024-10-24 04:01:25,476 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 04:01:25,623 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v1.c[1249,1262] [2024-10-24 04:01:25,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 04:01:25,713 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 04:01:25,721 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v1.c[1249,1262] [2024-10-24 04:01:25,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 04:01:25,787 INFO L204 MainTranslator]: Completed translation [2024-10-24 04:01:25,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:25 WrapperNode [2024-10-24 04:01:25,788 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 04:01:25,789 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 04:01:25,789 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 04:01:25,789 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 04:01:25,796 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:25" (1/1) ... [2024-10-24 04:01:25,811 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:25" (1/1) ... [2024-10-24 04:01:25,866 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 418 [2024-10-24 04:01:25,867 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 04:01:25,868 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 04:01:25,869 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 04:01:25,869 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 04:01:25,879 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:25" (1/1) ... [2024-10-24 04:01:25,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:25" (1/1) ... [2024-10-24 04:01:25,885 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:25" (1/1) ... [2024-10-24 04:01:25,914 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 04:01:25,915 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:25" (1/1) ... [2024-10-24 04:01:25,915 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:25" (1/1) ... [2024-10-24 04:01:25,933 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:25" (1/1) ... [2024-10-24 04:01:25,941 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:25" (1/1) ... [2024-10-24 04:01:25,945 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:25" (1/1) ... [2024-10-24 04:01:25,954 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:25" (1/1) ... [2024-10-24 04:01:25,960 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 04:01:25,960 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 04:01:25,961 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 04:01:25,961 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 04:01:25,962 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:25" (1/1) ... [2024-10-24 04:01:25,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 04:01:25,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 04:01:26,002 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 04:01:26,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 04:01:26,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 04:01:26,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 04:01:26,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 04:01:26,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 04:01:26,160 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 04:01:26,162 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 04:01:26,609 INFO L? ?]: Removed 169 outVars from TransFormulas that were not future-live. [2024-10-24 04:01:26,609 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 04:01:26,636 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 04:01:26,636 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 04:01:26,637 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:01:26 BoogieIcfgContainer [2024-10-24 04:01:26,637 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 04:01:26,639 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 04:01:26,639 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 04:01:26,642 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 04:01:26,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:01:25" (1/3) ... [2024-10-24 04:01:26,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ad9c28d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:01:26, skipping insertion in model container [2024-10-24 04:01:26,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:25" (2/3) ... [2024-10-24 04:01:26,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ad9c28d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:01:26, skipping insertion in model container [2024-10-24 04:01:26,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:01:26" (3/3) ... [2024-10-24 04:01:26,645 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.eq_sdp_v1.c [2024-10-24 04:01:26,658 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 04:01:26,659 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 04:01:26,715 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 04:01:26,721 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4ca0113e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 04:01:26,723 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 04:01:26,728 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 89 states have (on average 1.5056179775280898) internal successors, (134), 90 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:01:26,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-24 04:01:26,735 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 04:01:26,736 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 04:01:26,737 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 04:01:26,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 04:01:26,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1271046549, now seen corresponding path program 1 times [2024-10-24 04:01:26,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 04:01:26,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700001746] [2024-10-24 04:01:26,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 04:01:26,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 04:01:26,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 04:01:27,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 04:01:27,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 04:01:27,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700001746] [2024-10-24 04:01:27,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700001746] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 04:01:27,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 04:01:27,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 04:01:27,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101172639] [2024-10-24 04:01:27,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 04:01:27,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 04:01:27,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 04:01:27,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 04:01:27,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 04:01:27,441 INFO L87 Difference]: Start difference. First operand has 91 states, 89 states have (on average 1.5056179775280898) internal successors, (134), 90 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:01:27,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 04:01:27,489 INFO L93 Difference]: Finished difference Result 134 states and 198 transitions. [2024-10-24 04:01:27,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 04:01:27,491 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-10-24 04:01:27,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 04:01:27,499 INFO L225 Difference]: With dead ends: 134 [2024-10-24 04:01:27,500 INFO L226 Difference]: Without dead ends: 92 [2024-10-24 04:01:27,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 04:01:27,506 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 04:01:27,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 382 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 04:01:27,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-24 04:01:27,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-24 04:01:27,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.4725274725274726) internal successors, (134), 91 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:01:27,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2024-10-24 04:01:27,537 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 38 [2024-10-24 04:01:27,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 04:01:27,537 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2024-10-24 04:01:27,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:01:27,538 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2024-10-24 04:01:27,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-24 04:01:27,539 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 04:01:27,539 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 04:01:27,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 04:01:27,539 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 04:01:27,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 04:01:27,540 INFO L85 PathProgramCache]: Analyzing trace with hash 749432729, now seen corresponding path program 1 times [2024-10-24 04:01:27,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 04:01:27,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717692110] [2024-10-24 04:01:27,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 04:01:27,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 04:01:27,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 04:01:27,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 04:01:27,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 04:01:27,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717692110] [2024-10-24 04:01:27,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717692110] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 04:01:27,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 04:01:27,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 04:01:27,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54090190] [2024-10-24 04:01:27,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 04:01:27,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 04:01:27,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 04:01:27,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 04:01:27,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 04:01:27,702 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:01:27,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 04:01:27,741 INFO L93 Difference]: Finished difference Result 137 states and 198 transitions. [2024-10-24 04:01:27,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 04:01:27,744 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-10-24 04:01:27,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 04:01:27,745 INFO L225 Difference]: With dead ends: 137 [2024-10-24 04:01:27,745 INFO L226 Difference]: Without dead ends: 94 [2024-10-24 04:01:27,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 04:01:27,747 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 04:01:27,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 379 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 04:01:27,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-24 04:01:27,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-24 04:01:27,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 93 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:01:27,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 136 transitions. [2024-10-24 04:01:27,760 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 136 transitions. Word has length 39 [2024-10-24 04:01:27,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 04:01:27,760 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 136 transitions. [2024-10-24 04:01:27,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:01:27,762 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 136 transitions. [2024-10-24 04:01:27,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-24 04:01:27,763 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 04:01:27,763 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 04:01:27,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 04:01:27,764 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 04:01:27,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 04:01:27,766 INFO L85 PathProgramCache]: Analyzing trace with hash 659612398, now seen corresponding path program 1 times [2024-10-24 04:01:27,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 04:01:27,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392071062] [2024-10-24 04:01:27,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 04:01:27,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 04:01:27,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 04:01:28,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 04:01:28,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 04:01:28,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392071062] [2024-10-24 04:01:28,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392071062] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 04:01:28,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 04:01:28,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 04:01:28,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779413820] [2024-10-24 04:01:28,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 04:01:28,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 04:01:28,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 04:01:28,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 04:01:28,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 04:01:28,008 INFO L87 Difference]: Start difference. First operand 94 states and 136 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:01:28,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 04:01:28,056 INFO L93 Difference]: Finished difference Result 137 states and 197 transitions. [2024-10-24 04:01:28,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 04:01:28,057 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-10-24 04:01:28,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 04:01:28,058 INFO L225 Difference]: With dead ends: 137 [2024-10-24 04:01:28,061 INFO L226 Difference]: Without dead ends: 92 [2024-10-24 04:01:28,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 04:01:28,062 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 100 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 04:01:28,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 245 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 04:01:28,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-24 04:01:28,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-24 04:01:28,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.4505494505494505) internal successors, (132), 91 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:01:28,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 132 transitions. [2024-10-24 04:01:28,071 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 132 transitions. Word has length 40 [2024-10-24 04:01:28,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 04:01:28,072 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 132 transitions. [2024-10-24 04:01:28,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:01:28,072 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 132 transitions. [2024-10-24 04:01:28,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-24 04:01:28,073 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 04:01:28,073 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 04:01:28,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 04:01:28,073 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 04:01:28,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 04:01:28,074 INFO L85 PathProgramCache]: Analyzing trace with hash 537693180, now seen corresponding path program 1 times [2024-10-24 04:01:28,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 04:01:28,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817979093] [2024-10-24 04:01:28,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 04:01:28,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 04:01:28,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 04:01:28,129 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 04:01:28,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 04:01:28,184 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 04:01:28,185 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 04:01:28,186 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 04:01:28,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 04:01:28,190 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-24 04:01:28,230 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 04:01:28,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 04:01:28 BoogieIcfgContainer [2024-10-24 04:01:28,237 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 04:01:28,238 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 04:01:28,238 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 04:01:28,238 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 04:01:28,239 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:01:26" (3/4) ... [2024-10-24 04:01:28,241 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 04:01:28,242 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 04:01:28,242 INFO L158 Benchmark]: Toolchain (without parser) took 2801.77ms. Allocated memory was 197.1MB in the beginning and 272.6MB in the end (delta: 75.5MB). Free memory was 123.1MB in the beginning and 217.3MB in the end (delta: -94.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 04:01:28,243 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 197.1MB. Free memory is still 152.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 04:01:28,243 INFO L158 Benchmark]: CACSL2BoogieTranslator took 346.44ms. Allocated memory is still 197.1MB. Free memory was 123.0MB in the beginning and 160.1MB in the end (delta: -37.1MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. [2024-10-24 04:01:28,243 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.13ms. Allocated memory is still 197.1MB. Free memory was 160.1MB in the beginning and 150.6MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-24 04:01:28,243 INFO L158 Benchmark]: Boogie Preprocessor took 92.01ms. Allocated memory is still 197.1MB. Free memory was 150.6MB in the beginning and 144.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 04:01:28,246 INFO L158 Benchmark]: RCFGBuilder took 676.44ms. Allocated memory is still 197.1MB. Free memory was 144.4MB in the beginning and 90.9MB in the end (delta: 53.5MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-10-24 04:01:28,246 INFO L158 Benchmark]: TraceAbstraction took 1598.80ms. Allocated memory was 197.1MB in the beginning and 272.6MB in the end (delta: 75.5MB). Free memory was 89.8MB in the beginning and 217.3MB in the end (delta: -127.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 04:01:28,247 INFO L158 Benchmark]: Witness Printer took 3.88ms. Allocated memory is still 272.6MB. Free memory is still 217.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 04:01:28,248 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 197.1MB. Free memory is still 152.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 346.44ms. Allocated memory is still 197.1MB. Free memory was 123.0MB in the beginning and 160.1MB in the end (delta: -37.1MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.13ms. Allocated memory is still 197.1MB. Free memory was 160.1MB in the beginning and 150.6MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 92.01ms. Allocated memory is still 197.1MB. Free memory was 150.6MB in the beginning and 144.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 676.44ms. Allocated memory is still 197.1MB. Free memory was 144.4MB in the beginning and 90.9MB in the end (delta: 53.5MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1598.80ms. Allocated memory was 197.1MB in the beginning and 272.6MB in the end (delta: 75.5MB). Free memory was 89.8MB in the beginning and 217.3MB in the end (delta: -127.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.88ms. Allocated memory is still 272.6MB. Free memory is still 217.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 102. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 8); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (8 - 1); [L29] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 1); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (1 - 1); [L32] const SORT_1 var_10 = 0; [L33] const SORT_5 var_18 = 1; [L34] const SORT_5 var_28 = 0; [L36] SORT_1 input_2; [L37] SORT_1 input_3; [L38] SORT_1 input_4; [L39] SORT_5 input_6; [L40] SORT_5 input_7; [L41] SORT_5 input_8; [L42] SORT_5 input_9; [L44] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L44] SORT_1 state_11 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L45] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L45] SORT_1 state_13 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L46] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L46] SORT_1 state_22 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L47] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L47] SORT_1 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L48] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L48] SORT_1 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L49] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L49] SORT_5 state_29 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L50] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L50] SORT_5 state_31 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L51] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L51] SORT_1 state_33 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L52] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L52] SORT_5 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L53] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L53] SORT_1 state_37 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L54] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L54] SORT_1 state_40 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L55] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L55] SORT_1 state_42 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] SORT_1 init_12_arg_1 = var_10; [L58] state_11 = init_12_arg_1 [L59] SORT_1 init_14_arg_1 = var_10; [L60] state_13 = init_14_arg_1 [L61] SORT_1 init_23_arg_1 = var_10; [L62] state_22 = init_23_arg_1 [L63] SORT_1 init_25_arg_1 = var_10; [L64] state_24 = init_25_arg_1 [L65] SORT_1 init_27_arg_1 = var_10; [L66] state_26 = init_27_arg_1 [L67] SORT_5 init_30_arg_1 = var_28; [L68] state_29 = init_30_arg_1 [L69] SORT_5 init_32_arg_1 = var_28; [L70] state_31 = init_32_arg_1 [L71] SORT_1 init_34_arg_1 = var_10; [L72] state_33 = init_34_arg_1 [L73] SORT_5 init_36_arg_1 = var_28; [L74] state_35 = init_36_arg_1 [L75] SORT_1 init_38_arg_1 = var_10; [L76] state_37 = init_38_arg_1 [L77] SORT_1 init_41_arg_1 = var_10; [L78] state_40 = init_41_arg_1 [L79] SORT_1 init_43_arg_1 = var_10; [L80] state_42 = init_43_arg_1 VAL [mask_SORT_1=255, mask_SORT_5=1, state_11=0, state_13=0, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L83] input_2 = __VERIFIER_nondet_uchar() [L84] input_3 = __VERIFIER_nondet_uchar() [L85] input_4 = __VERIFIER_nondet_uchar() [L86] input_6 = __VERIFIER_nondet_uchar() [L87] input_7 = __VERIFIER_nondet_uchar() [L88] EXPR input_7 & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, state_11=0, state_13=0, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L88] input_7 = input_7 & mask_SORT_5 [L89] input_8 = __VERIFIER_nondet_uchar() [L90] EXPR input_8 & mask_SORT_5 VAL [input_7=0, mask_SORT_1=255, mask_SORT_5=1, state_11=0, state_13=0, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L90] input_8 = input_8 & mask_SORT_5 [L91] input_9 = __VERIFIER_nondet_uchar() [L92] EXPR input_9 & mask_SORT_5 VAL [input_7=0, input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_11=0, state_13=0, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L92] input_9 = input_9 & mask_SORT_5 [L95] SORT_1 var_15_arg_0 = state_11; [L96] SORT_1 var_15_arg_1 = state_13; [L97] SORT_5 var_15 = var_15_arg_0 == var_15_arg_1; [L98] SORT_5 var_19_arg_0 = var_15; [L99] SORT_5 var_19 = ~var_19_arg_0; [L100] SORT_5 var_20_arg_0 = var_18; [L101] SORT_5 var_20_arg_1 = var_19; VAL [input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_5=1, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_20_arg_0=1, var_20_arg_1=-2, var_28=0] [L102] EXPR var_20_arg_0 & var_20_arg_1 VAL [input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_5=1, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L102] SORT_5 var_20 = var_20_arg_0 & var_20_arg_1; [L103] EXPR var_20 & mask_SORT_5 VAL [input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_5=1, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L103] var_20 = var_20 & mask_SORT_5 [L104] SORT_5 bad_21_arg_0 = var_20; [L105] CALL __VERIFIER_assert(!(bad_21_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 91 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 100 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 100 mSDsluCounter, 1006 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 625 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 41 IncrementalHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 381 mSDtfsCounter, 41 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=2, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 158 NumberOfCodeBlocks, 158 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 114 ConstructedInterpolants, 0 QuantifiedInterpolants, 211 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 04:01:28,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash caa84a091b99b66a1da3990b205ee8e8e4cfa2478d32b035bf8784a52ef5640a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 04:01:30,250 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 04:01:30,321 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-24 04:01:30,325 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 04:01:30,327 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 04:01:30,354 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 04:01:30,361 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 04:01:30,361 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 04:01:30,361 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 04:01:30,362 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 04:01:30,362 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 04:01:30,362 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 04:01:30,363 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 04:01:30,363 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 04:01:30,363 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 04:01:30,363 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 04:01:30,364 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 04:01:30,364 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 04:01:30,364 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 04:01:30,364 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 04:01:30,365 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 04:01:30,367 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 04:01:30,367 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 04:01:30,367 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 04:01:30,368 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 04:01:30,368 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 04:01:30,368 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 04:01:30,368 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 04:01:30,368 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 04:01:30,368 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 04:01:30,369 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 04:01:30,369 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 04:01:30,369 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 04:01:30,369 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 04:01:30,369 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 04:01:30,369 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 04:01:30,370 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 04:01:30,370 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 04:01:30,370 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 04:01:30,375 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 04:01:30,376 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 04:01:30,376 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 04:01:30,376 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> caa84a091b99b66a1da3990b205ee8e8e4cfa2478d32b035bf8784a52ef5640a [2024-10-24 04:01:30,670 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 04:01:30,696 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 04:01:30,699 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 04:01:30,700 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 04:01:30,701 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 04:01:30,702 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v1.c [2024-10-24 04:01:32,071 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 04:01:32,312 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 04:01:32,313 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v1.c [2024-10-24 04:01:32,327 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7b0a5a68/673ad7b396e743a6b7817024c65ec311/FLAG82ab41d56 [2024-10-24 04:01:32,343 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7b0a5a68/673ad7b396e743a6b7817024c65ec311 [2024-10-24 04:01:32,347 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 04:01:32,349 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 04:01:32,350 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 04:01:32,351 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 04:01:32,356 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 04:01:32,357 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:01:32" (1/1) ... [2024-10-24 04:01:32,357 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c976092 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:32, skipping insertion in model container [2024-10-24 04:01:32,358 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:01:32" (1/1) ... [2024-10-24 04:01:32,388 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 04:01:32,552 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v1.c[1249,1262] [2024-10-24 04:01:32,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 04:01:32,645 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 04:01:32,668 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v1.c[1249,1262] [2024-10-24 04:01:32,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 04:01:32,747 INFO L204 MainTranslator]: Completed translation [2024-10-24 04:01:32,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:32 WrapperNode [2024-10-24 04:01:32,748 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 04:01:32,749 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 04:01:32,749 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 04:01:32,749 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 04:01:32,759 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:32" (1/1) ... [2024-10-24 04:01:32,769 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:32" (1/1) ... [2024-10-24 04:01:32,797 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 250 [2024-10-24 04:01:32,798 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 04:01:32,801 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 04:01:32,801 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 04:01:32,801 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 04:01:32,812 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:32" (1/1) ... [2024-10-24 04:01:32,812 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:32" (1/1) ... [2024-10-24 04:01:32,818 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:32" (1/1) ... [2024-10-24 04:01:32,836 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 04:01:32,837 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:32" (1/1) ... [2024-10-24 04:01:32,837 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:32" (1/1) ... [2024-10-24 04:01:32,847 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:32" (1/1) ... [2024-10-24 04:01:32,850 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:32" (1/1) ... [2024-10-24 04:01:32,851 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:32" (1/1) ... [2024-10-24 04:01:32,853 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:32" (1/1) ... [2024-10-24 04:01:32,855 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 04:01:32,856 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 04:01:32,857 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 04:01:32,857 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 04:01:32,862 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:32" (1/1) ... [2024-10-24 04:01:32,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 04:01:32,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 04:01:32,904 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 04:01:32,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 04:01:32,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 04:01:32,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 04:01:32,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 04:01:32,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 04:01:33,060 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 04:01:33,062 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 04:01:33,357 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2024-10-24 04:01:33,357 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 04:01:33,384 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 04:01:33,385 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 04:01:33,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:01:33 BoogieIcfgContainer [2024-10-24 04:01:33,386 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 04:01:33,388 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 04:01:33,389 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 04:01:33,392 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 04:01:33,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:01:32" (1/3) ... [2024-10-24 04:01:33,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51f6ed6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:01:33, skipping insertion in model container [2024-10-24 04:01:33,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:32" (2/3) ... [2024-10-24 04:01:33,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51f6ed6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:01:33, skipping insertion in model container [2024-10-24 04:01:33,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:01:33" (3/3) ... [2024-10-24 04:01:33,395 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.eq_sdp_v1.c [2024-10-24 04:01:33,411 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 04:01:33,411 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 04:01:33,464 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 04:01:33,470 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@72ee806f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 04:01:33,471 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 04:01:33,477 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:01:33,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-24 04:01:33,482 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 04:01:33,483 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-24 04:01:33,484 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 04:01:33,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 04:01:33,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-24 04:01:33,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 04:01:33,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [671653205] [2024-10-24 04:01:33,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 04:01:33,505 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 04:01:33,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 04:01:33,529 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 04:01:33,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 04:01:33,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 04:01:33,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-24 04:01:33,643 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 04:01:33,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 04:01:33,790 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 04:01:33,790 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 04:01:33,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [671653205] [2024-10-24 04:01:33,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [671653205] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 04:01:33,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 04:01:33,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 04:01:33,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133155489] [2024-10-24 04:01:33,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 04:01:33,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 04:01:33,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 04:01:33,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 04:01:33,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 04:01:33,823 INFO L87 Difference]: Start difference. First operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:01:33,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 04:01:33,858 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2024-10-24 04:01:33,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 04:01:33,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-24 04:01:33,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 04:01:33,870 INFO L225 Difference]: With dead ends: 14 [2024-10-24 04:01:33,871 INFO L226 Difference]: Without dead ends: 8 [2024-10-24 04:01:33,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 04:01:33,877 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 04:01:33,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 04:01:33,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2024-10-24 04:01:33,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2024-10-24 04:01:33,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:01:33,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-24 04:01:33,904 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-24 04:01:33,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 04:01:33,904 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-24 04:01:33,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:01:33,905 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-24 04:01:33,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-24 04:01:33,905 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 04:01:33,905 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-24 04:01:33,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-24 04:01:34,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 04:01:34,108 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 04:01:34,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 04:01:34,109 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-24 04:01:34,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 04:01:34,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [107213726] [2024-10-24 04:01:34,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 04:01:34,110 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 04:01:34,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 04:01:34,113 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 04:01:34,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 04:01:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 04:01:34,216 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-24 04:01:34,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 04:01:34,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 04:01:34,436 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 04:01:39,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 04:01:39,245 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 04:01:39,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [107213726] [2024-10-24 04:01:39,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [107213726] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 04:01:39,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 04:01:39,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-24 04:01:39,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802232099] [2024-10-24 04:01:39,246 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 04:01:39,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 04:01:39,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 04:01:39,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 04:01:39,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-24 04:01:39,248 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:01:39,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 04:01:39,795 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2024-10-24 04:01:39,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 04:01:39,796 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-24 04:01:39,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 04:01:39,796 INFO L225 Difference]: With dead ends: 13 [2024-10-24 04:01:39,796 INFO L226 Difference]: Without dead ends: 11 [2024-10-24 04:01:39,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-24 04:01:39,797 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 04:01:39,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 04:01:39,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-10-24 04:01:39,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-10-24 04:01:39,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:01:39,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2024-10-24 04:01:39,801 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2024-10-24 04:01:39,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 04:01:39,801 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2024-10-24 04:01:39,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:01:39,802 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2024-10-24 04:01:39,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-24 04:01:39,803 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 04:01:39,803 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2024-10-24 04:01:39,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 04:01:40,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 04:01:40,004 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 04:01:40,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 04:01:40,004 INFO L85 PathProgramCache]: Analyzing trace with hash 148265266, now seen corresponding path program 2 times [2024-10-24 04:01:40,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 04:01:40,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [205918217] [2024-10-24 04:01:40,005 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 04:01:40,005 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 04:01:40,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 04:01:40,008 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 04:01:40,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 04:01:40,114 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 04:01:40,114 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 04:01:40,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-24 04:01:40,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 04:01:42,089 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 04:01:42,089 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 04:01:53,266 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse23 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_5~0#1|))) (let ((.cse2 (forall ((|v_ULTIMATE.start_main_~var_20_arg_0~0#1_21| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv254 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_0~0#1_21|))))))))) (.cse3 (forall ((|v_ULTIMATE.start_main_~var_20_arg_0~0#1_21| (_ BitVec 8))) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_0~0#1_21|)))) .cse23)) (_ bv0 8)))) (.cse0 (= (_ bv0 8) |c_ULTIMATE.start_main_~state_29~0#1|)) (.cse9 (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_31~0#1|))) .cse23)))) (.cse10 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_26~0#1|))))) (let ((.cse5 (bvneg .cse10)) (.cse7 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_40~0#1|)))))) (.cse8 (not .cse9)) (.cse12 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_24~0#1|)) (.cse13 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_22~0#1|)) (.cse14 (not .cse0)) (.cse1 (let ((.cse18 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_10~0#1|))))) (let ((.cse21 (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_28~0#1|))) .cse23)) (_ bv0 8))) (.cse20 ((_ zero_extend 24) ((_ extract 7 0) .cse18)))) (and (or .cse3 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse19 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvmul .cse18 (_ bv2 32)))))))) .cse19))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse19 .cse20)))))) .cse21) .cse2 (or (not .cse21) .cse3 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse22 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse18 (bvneg .cse18)))))))) .cse22))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse20)))))))))))) (and (or .cse0 .cse1) (or .cse0 (let ((.cse4 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse12 .cse13))))))))) (and .cse2 (or .cse3 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse6 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse4 .cse5))))))) .cse6))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 .cse6)))))) .cse8) (or .cse3 .cse9 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse11 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse4 .cse10))))))) .cse11))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 .cse11)))))))))) (or .cse14 (let ((.cse15 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd (bvneg .cse12) .cse13))))))))) (and (or .cse3 .cse9 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse16 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse15 .cse10))))))) .cse16))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 .cse16))))))) .cse2 (or .cse3 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse17 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse15 .cse5))))))) .cse17))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 .cse17)))))) .cse8)))) (or .cse14 .cse1))))) is different from false [2024-10-24 04:01:57,229 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-10-24 04:01:57,230 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 04:01:57,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [205918217] [2024-10-24 04:01:57,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [205918217] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 04:01:57,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 04:01:57,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-10-24 04:01:57,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068753115] [2024-10-24 04:01:57,230 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 04:01:57,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 04:01:57,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 04:01:57,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 04:01:57,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=55, Unknown=1, NotChecked=14, Total=90 [2024-10-24 04:01:57,234 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:02:03,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 04:02:03,727 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2024-10-24 04:02:03,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 04:02:03,728 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-24 04:02:03,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 04:02:03,728 INFO L225 Difference]: With dead ends: 16 [2024-10-24 04:02:03,728 INFO L226 Difference]: Without dead ends: 14 [2024-10-24 04:02:03,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=55, Invalid=130, Unknown=1, NotChecked=24, Total=210 [2024-10-24 04:02:03,729 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 04:02:03,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 8 Unchecked, 0.6s Time] [2024-10-24 04:02:03,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-10-24 04:02:03,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-10-24 04:02:03,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:02:03,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2024-10-24 04:02:03,734 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 10 [2024-10-24 04:02:03,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 04:02:03,734 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2024-10-24 04:02:03,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 04:02:03,734 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2024-10-24 04:02:03,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-24 04:02:03,734 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 04:02:03,734 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2024-10-24 04:02:03,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 04:02:03,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 04:02:03,939 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 04:02:03,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 04:02:03,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1748931734, now seen corresponding path program 3 times [2024-10-24 04:02:03,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 04:02:03,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1239853573] [2024-10-24 04:02:03,940 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 04:02:03,940 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 04:02:03,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 04:02:03,944 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 04:02:03,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 04:02:04,098 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-10-24 04:02:04,099 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 04:02:04,102 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-24 04:02:04,106 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 04:02:54,133 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 04:02:54,133 INFO L311 TraceCheckSpWp]: Computing backward predicates...