./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-61.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-61.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash 70761ec11e58c10698e5aa0cf29d007b987b034e5642b1a07232bb0cab676aec --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:50:07,457 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:50:07,568 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 06:50:07,573 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:50:07,574 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:50:07,597 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:50:07,598 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:50:07,598 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:50:07,599 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:50:07,599 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:50:07,599 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:50:07,599 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:50:07,600 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:50:07,600 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:50:07,600 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:50:07,601 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:50:07,601 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:50:07,601 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:50:07,601 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 06:50:07,602 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:50:07,602 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:50:07,606 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:50:07,606 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:50:07,606 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:50:07,606 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:50:07,607 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:50:07,607 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:50:07,607 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:50:07,607 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:50:07,608 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:50:07,608 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:50:07,611 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:50:07,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:50:07,612 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:50:07,612 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:50:07,612 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:50:07,612 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 06:50:07,612 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 06:50:07,612 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:50:07,613 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:50:07,613 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:50:07,613 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:50:07,613 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 70761ec11e58c10698e5aa0cf29d007b987b034e5642b1a07232bb0cab676aec [2024-11-12 06:50:07,878 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:50:07,895 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:50:07,898 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:50:07,899 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:50:07,900 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:50:07,900 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-61.i [2024-11-12 06:50:09,462 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:50:09,631 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:50:09,632 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-61.i [2024-11-12 06:50:09,646 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8ce401b1/42f9d869a56848bdb1d004fc302be77a/FLAG1166d48ca [2024-11-12 06:50:09,658 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8ce401b1/42f9d869a56848bdb1d004fc302be77a [2024-11-12 06:50:09,660 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:50:09,661 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:50:09,663 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:50:09,663 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:50:09,671 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:50:09,672 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:50:09" (1/1) ... [2024-11-12 06:50:09,673 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e15e460 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:50:09, skipping insertion in model container [2024-11-12 06:50:09,675 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:50:09" (1/1) ... [2024-11-12 06:50:09,698 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:50:09,956 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-61.i[915,928] [2024-11-12 06:50:10,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:50:10,013 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:50:10,023 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-61.i[915,928] [2024-11-12 06:50:10,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:50:10,079 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:50:10,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:50:10 WrapperNode [2024-11-12 06:50:10,083 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:50:10,084 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:50:10,087 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:50:10,087 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:50:10,093 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:50:10" (1/1) ... [2024-11-12 06:50:10,106 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:50:10" (1/1) ... [2024-11-12 06:50:10,133 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 172 [2024-11-12 06:50:10,134 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:50:10,135 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:50:10,135 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:50:10,135 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:50:10,145 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:50:10" (1/1) ... [2024-11-12 06:50:10,146 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:50:10" (1/1) ... [2024-11-12 06:50:10,153 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:50:10" (1/1) ... [2024-11-12 06:50:10,185 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-11-12 06:50:10,185 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:50:10" (1/1) ... [2024-11-12 06:50:10,185 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:50:10" (1/1) ... [2024-11-12 06:50:10,206 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:50:10" (1/1) ... [2024-11-12 06:50:10,209 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:50:10" (1/1) ... [2024-11-12 06:50:10,213 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:50:10" (1/1) ... [2024-11-12 06:50:10,218 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:50:10" (1/1) ... [2024-11-12 06:50:10,227 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:50:10,231 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:50:10,231 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:50:10,231 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:50:10,232 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:50:10" (1/1) ... [2024-11-12 06:50:10,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:50:10,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:50:10,286 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-11-12 06:50:10,289 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-11-12 06:50:10,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:50:10,346 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:50:10,347 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:50:10,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 06:50:10,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:50:10,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:50:10,415 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:50:10,417 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:50:10,847 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-12 06:50:10,847 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:50:10,866 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:50:10,867 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:50:10,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:50:10 BoogieIcfgContainer [2024-11-12 06:50:10,867 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:50:10,869 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:50:10,869 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:50:10,872 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:50:10,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:50:09" (1/3) ... [2024-11-12 06:50:10,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f36ebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:50:10, skipping insertion in model container [2024-11-12 06:50:10,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:50:10" (2/3) ... [2024-11-12 06:50:10,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f36ebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:50:10, skipping insertion in model container [2024-11-12 06:50:10,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:50:10" (3/3) ... [2024-11-12 06:50:10,876 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-61.i [2024-11-12 06:50:10,890 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:50:10,890 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:50:10,949 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:50:10,955 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;@7bc3b4c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:50:10,955 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:50:10,959 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 57 states have internal predecessors, (81), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 06:50:10,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-12 06:50:10,969 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:50:10,970 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 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-11-12 06:50:10,971 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:50:10,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:50:10,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1088730879, now seen corresponding path program 1 times [2024-11-12 06:50:10,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:50:10,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714890344] [2024-11-12 06:50:10,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:50:10,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:50:11,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:11,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:50:11,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:11,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:50:11,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:11,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:50:11,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:11,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:50:11,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:11,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:50:11,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:11,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 06:50:11,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:11,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:50:11,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:11,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 06:50:11,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:11,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:50:11,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:11,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 06:50:11,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:11,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:50:11,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:11,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 06:50:11,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:11,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 06:50:11,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:11,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 06:50:11,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:11,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 06:50:11,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:11,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 06:50:11,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:11,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 06:50:11,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:11,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 06:50:11,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:11,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 06:50:11,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:11,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 06:50:11,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:11,248 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 06:50:11,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:50:11,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714890344] [2024-11-12 06:50:11,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714890344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:50:11,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:50:11,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:50:11,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140377025] [2024-11-12 06:50:11,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:50:11,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 06:50:11,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:50:11,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 06:50:11,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:50:11,282 INFO L87 Difference]: Start difference. First operand has 79 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 57 states have internal predecessors, (81), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 06:50:11,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:50:11,304 INFO L93 Difference]: Finished difference Result 151 states and 256 transitions. [2024-11-12 06:50:11,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 06:50:11,306 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 133 [2024-11-12 06:50:11,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:50:11,314 INFO L225 Difference]: With dead ends: 151 [2024-11-12 06:50:11,314 INFO L226 Difference]: Without dead ends: 75 [2024-11-12 06:50:11,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:50:11,321 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:50:11,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:50:11,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-12 06:50:11,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-12 06:50:11,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 53 states have internal predecessors, (72), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 06:50:11,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 112 transitions. [2024-11-12 06:50:11,368 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 112 transitions. Word has length 133 [2024-11-12 06:50:11,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:50:11,370 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 112 transitions. [2024-11-12 06:50:11,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 06:50:11,370 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 112 transitions. [2024-11-12 06:50:11,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-12 06:50:11,376 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:50:11,376 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 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-11-12 06:50:11,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 06:50:11,378 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:50:11,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:50:11,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1293932415, now seen corresponding path program 1 times [2024-11-12 06:50:11,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:50:11,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263093462] [2024-11-12 06:50:11,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:50:11,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:50:11,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:11,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:50:11,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:11,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:50:11,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:11,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:50:11,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:11,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:50:11,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:11,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:50:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:11,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 06:50:11,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:11,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:50:11,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:11,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 06:50:11,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:11,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:50:11,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:11,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 06:50:11,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:11,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:50:11,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:11,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 06:50:11,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:11,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 06:50:11,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:11,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 06:50:11,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:11,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 06:50:11,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:11,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 06:50:11,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:11,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 06:50:11,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:11,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 06:50:11,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:11,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 06:50:11,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:11,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 06:50:11,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:11,698 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 06:50:11,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:50:11,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263093462] [2024-11-12 06:50:11,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263093462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:50:11,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:50:11,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 06:50:11,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853697072] [2024-11-12 06:50:11,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:50:11,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 06:50:11,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:50:11,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 06:50:11,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 06:50:11,705 INFO L87 Difference]: Start difference. First operand 75 states and 112 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 06:50:11,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:50:11,734 INFO L93 Difference]: Finished difference Result 147 states and 221 transitions. [2024-11-12 06:50:11,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 06:50:11,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 133 [2024-11-12 06:50:11,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:50:11,738 INFO L225 Difference]: With dead ends: 147 [2024-11-12 06:50:11,738 INFO L226 Difference]: Without dead ends: 75 [2024-11-12 06:50:11,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 06:50:11,741 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:50:11,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 216 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:50:11,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-12 06:50:11,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-12 06:50:11,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 53 states have internal predecessors, (71), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 06:50:11,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 111 transitions. [2024-11-12 06:50:11,756 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 111 transitions. Word has length 133 [2024-11-12 06:50:11,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:50:11,758 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 111 transitions. [2024-11-12 06:50:11,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 06:50:11,759 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 111 transitions. [2024-11-12 06:50:11,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-12 06:50:11,762 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:50:11,762 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 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-11-12 06:50:11,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 06:50:11,762 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:50:11,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:50:11,763 INFO L85 PathProgramCache]: Analyzing trace with hash -700212291, now seen corresponding path program 1 times [2024-11-12 06:50:11,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:50:11,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662135873] [2024-11-12 06:50:11,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:50:11,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:50:11,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:12,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:50:12,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:12,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:50:12,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:12,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:50:12,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:12,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:50:12,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:12,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:50:12,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:12,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 06:50:12,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:12,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:50:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:12,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 06:50:12,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:12,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:50:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:12,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 06:50:12,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:12,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:50:12,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:12,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 06:50:12,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:12,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 06:50:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:12,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 06:50:12,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:12,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 06:50:12,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:12,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 06:50:12,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:12,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 06:50:12,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:12,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 06:50:12,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:12,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 06:50:12,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:12,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 06:50:12,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:12,147 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 06:50:12,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:50:12,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662135873] [2024-11-12 06:50:12,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662135873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:50:12,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:50:12,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 06:50:12,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273083994] [2024-11-12 06:50:12,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:50:12,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 06:50:12,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:50:12,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 06:50:12,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 06:50:12,149 INFO L87 Difference]: Start difference. First operand 75 states and 111 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 06:50:12,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:50:12,335 INFO L93 Difference]: Finished difference Result 217 states and 323 transitions. [2024-11-12 06:50:12,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 06:50:12,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 133 [2024-11-12 06:50:12,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:50:12,337 INFO L225 Difference]: With dead ends: 217 [2024-11-12 06:50:12,337 INFO L226 Difference]: Without dead ends: 145 [2024-11-12 06:50:12,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 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-11-12 06:50:12,339 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 96 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 06:50:12,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 279 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 06:50:12,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-12 06:50:12,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 92. [2024-11-12 06:50:12,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 70 states have (on average 1.4) internal successors, (98), 70 states have internal predecessors, (98), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 06:50:12,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 138 transitions. [2024-11-12 06:50:12,349 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 138 transitions. Word has length 133 [2024-11-12 06:50:12,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:50:12,349 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 138 transitions. [2024-11-12 06:50:12,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 06:50:12,350 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 138 transitions. [2024-11-12 06:50:12,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-12 06:50:12,351 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:50:12,351 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 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-11-12 06:50:12,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 06:50:12,351 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:50:12,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:50:12,352 INFO L85 PathProgramCache]: Analyzing trace with hash 579651387, now seen corresponding path program 1 times [2024-11-12 06:50:12,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:50:12,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318595306] [2024-11-12 06:50:12,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:50:12,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:50:12,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:12,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:50:12,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:12,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:50:12,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:12,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:50:12,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:12,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:50:12,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:12,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:50:12,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:12,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 06:50:12,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:12,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:50:12,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:12,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 06:50:12,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:12,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:50:12,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:12,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 06:50:12,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:12,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:50:12,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:12,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 06:50:12,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:12,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 06:50:12,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:12,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 06:50:12,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:12,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 06:50:12,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:12,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 06:50:12,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:12,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 06:50:12,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:12,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 06:50:12,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:12,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 06:50:12,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:12,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 06:50:12,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:12,666 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 06:50:12,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:50:12,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318595306] [2024-11-12 06:50:12,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318595306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:50:12,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:50:12,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 06:50:12,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396983086] [2024-11-12 06:50:12,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:50:12,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 06:50:12,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:50:12,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 06:50:12,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 06:50:12,671 INFO L87 Difference]: Start difference. First operand 92 states and 138 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 06:50:12,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:50:12,813 INFO L93 Difference]: Finished difference Result 181 states and 273 transitions. [2024-11-12 06:50:12,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 06:50:12,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 133 [2024-11-12 06:50:12,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:50:12,818 INFO L225 Difference]: With dead ends: 181 [2024-11-12 06:50:12,818 INFO L226 Difference]: Without dead ends: 92 [2024-11-12 06:50:12,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 06:50:12,820 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 73 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 06:50:12,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 167 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 06:50:12,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-12 06:50:12,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-12 06:50:12,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 70 states have internal predecessors, (97), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 06:50:12,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 137 transitions. [2024-11-12 06:50:12,832 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 137 transitions. Word has length 133 [2024-11-12 06:50:12,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:50:12,832 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 137 transitions. [2024-11-12 06:50:12,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 06:50:12,833 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 137 transitions. [2024-11-12 06:50:12,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-12 06:50:12,834 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:50:12,834 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 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-11-12 06:50:12,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 06:50:12,834 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:50:12,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:50:12,835 INFO L85 PathProgramCache]: Analyzing trace with hash -441416967, now seen corresponding path program 1 times [2024-11-12 06:50:12,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:50:12,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498478464] [2024-11-12 06:50:12,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:50:12,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:50:12,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:13,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:50:13,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:13,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:50:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:13,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:50:13,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:13,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:50:13,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:13,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:50:13,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:13,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 06:50:13,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:13,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:50:13,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:13,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 06:50:13,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:13,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:50:13,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:13,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 06:50:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:13,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:50:13,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:13,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 06:50:13,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:13,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 06:50:13,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:13,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 06:50:13,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:13,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 06:50:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:13,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 06:50:13,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:13,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 06:50:13,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:13,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 06:50:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:13,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 06:50:13,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:13,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 06:50:13,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:13,166 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 06:50:13,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:50:13,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498478464] [2024-11-12 06:50:13,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498478464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:50:13,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:50:13,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 06:50:13,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181691226] [2024-11-12 06:50:13,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:50:13,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 06:50:13,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:50:13,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 06:50:13,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 06:50:13,168 INFO L87 Difference]: Start difference. First operand 92 states and 137 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 06:50:13,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:50:13,318 INFO L93 Difference]: Finished difference Result 234 states and 347 transitions. [2024-11-12 06:50:13,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 06:50:13,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 133 [2024-11-12 06:50:13,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:50:13,320 INFO L225 Difference]: With dead ends: 234 [2024-11-12 06:50:13,320 INFO L226 Difference]: Without dead ends: 145 [2024-11-12 06:50:13,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 06:50:13,321 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 169 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 06:50:13,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 238 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 06:50:13,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-12 06:50:13,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 97. [2024-11-12 06:50:13,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 75 states have (on average 1.36) internal successors, (102), 75 states have internal predecessors, (102), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 06:50:13,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 142 transitions. [2024-11-12 06:50:13,335 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 142 transitions. Word has length 133 [2024-11-12 06:50:13,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:50:13,335 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 142 transitions. [2024-11-12 06:50:13,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 06:50:13,335 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 142 transitions. [2024-11-12 06:50:13,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-12 06:50:13,336 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:50:13,337 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 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-11-12 06:50:13,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 06:50:13,337 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:50:13,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:50:13,337 INFO L85 PathProgramCache]: Analyzing trace with hash -876109093, now seen corresponding path program 1 times [2024-11-12 06:50:13,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:50:13,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055683985] [2024-11-12 06:50:13,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:50:13,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:50:13,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 06:50:13,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1077642838] [2024-11-12 06:50:13,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:50:13,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 06:50:13,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:50:13,430 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 06:50:13,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 06:50:13,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 06:50:13,568 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 06:50:13,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 06:50:13,672 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 06:50:13,672 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 06:50:13,674 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 06:50:13,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 06:50:13,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-12 06:50:13,879 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-12 06:50:13,973 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 06:50:13,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 06:50:13 BoogieIcfgContainer [2024-11-12 06:50:13,976 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 06:50:13,976 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 06:50:13,976 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 06:50:13,977 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 06:50:13,977 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:50:10" (3/4) ... [2024-11-12 06:50:13,979 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 06:50:13,980 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 06:50:13,981 INFO L158 Benchmark]: Toolchain (without parser) took 4319.54ms. Allocated memory was 167.8MB in the beginning and 224.4MB in the end (delta: 56.6MB). Free memory was 97.5MB in the beginning and 118.3MB in the end (delta: -20.8MB). Peak memory consumption was 38.8MB. Max. memory is 16.1GB. [2024-11-12 06:50:13,981 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 117.4MB. Free memory is still 80.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:50:13,981 INFO L158 Benchmark]: CACSL2BoogieTranslator took 420.53ms. Allocated memory is still 167.8MB. Free memory was 97.3MB in the beginning and 133.0MB in the end (delta: -35.6MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2024-11-12 06:50:13,981 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.82ms. Allocated memory is still 167.8MB. Free memory was 133.0MB in the beginning and 130.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 06:50:13,982 INFO L158 Benchmark]: Boogie Preprocessor took 95.49ms. Allocated memory is still 167.8MB. Free memory was 130.3MB in the beginning and 126.6MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 06:50:13,982 INFO L158 Benchmark]: RCFGBuilder took 636.47ms. Allocated memory is still 167.8MB. Free memory was 126.6MB in the beginning and 104.4MB in the end (delta: 22.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-12 06:50:13,982 INFO L158 Benchmark]: TraceAbstraction took 3107.19ms. Allocated memory was 167.8MB in the beginning and 224.4MB in the end (delta: 56.6MB). Free memory was 103.6MB in the beginning and 118.3MB in the end (delta: -14.7MB). Peak memory consumption was 44.5MB. Max. memory is 16.1GB. [2024-11-12 06:50:13,982 INFO L158 Benchmark]: Witness Printer took 4.02ms. Allocated memory is still 224.4MB. Free memory is still 118.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:50:13,983 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.14ms. Allocated memory is still 117.4MB. Free memory is still 80.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 420.53ms. Allocated memory is still 167.8MB. Free memory was 97.3MB in the beginning and 133.0MB in the end (delta: -35.6MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.82ms. Allocated memory is still 167.8MB. Free memory was 133.0MB in the beginning and 130.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 95.49ms. Allocated memory is still 167.8MB. Free memory was 130.3MB in the beginning and 126.6MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 636.47ms. Allocated memory is still 167.8MB. Free memory was 126.6MB in the beginning and 104.4MB in the end (delta: 22.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 3107.19ms. Allocated memory was 167.8MB in the beginning and 224.4MB in the end (delta: 56.6MB). Free memory was 103.6MB in the beginning and 118.3MB in the end (delta: -14.7MB). Peak memory consumption was 44.5MB. Max. memory is 16.1GB. * Witness Printer took 4.02ms. Allocated memory is still 224.4MB. Free memory is still 118.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: 19]: 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 someBinaryFLOATComparisonOperation at line 129, overapproximation of someBinaryDOUBLEComparisonOperation at line 129. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 8.5; [L23] unsigned long int var_1_4 = 1; [L24] unsigned long int var_1_5 = 50; [L25] unsigned long int var_1_6 = 4; [L26] float var_1_7 = 15.8; [L27] float var_1_8 = 64.25; [L28] signed long int var_1_9 = -50; [L29] unsigned char var_1_13 = 1; [L30] unsigned long int var_1_14 = 3207304078; [L31] unsigned long int var_1_15 = 50; [L32] unsigned long int var_1_16 = 25; [L33] unsigned char var_1_17 = 1; [L34] unsigned char var_1_18 = 0; [L35] unsigned char var_1_19 = 0; [L36] unsigned short int var_1_20 = 1; [L37] unsigned long int var_1_21 = 50; [L38] signed char var_1_22 = -4; [L39] signed char var_1_23 = -10; [L40] signed long int last_1_var_1_9 = -50; VAL [isInitial=0, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=50, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L133] isInitial = 1 [L134] FCALL initially() [L135] COND TRUE 1 [L136] CALL updateLastVariables() [L126] last_1_var_1_9 = var_1_9 VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=50, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L136] RET updateLastVariables() [L137] CALL updateVariables() [L94] var_1_5 = __VERIFIER_nondet_ulong() [L95] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L95] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L96] CALL assume_abort_if_not(var_1_5 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L96] RET assume_abort_if_not(var_1_5 <= 4294967294) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L97] var_1_6 = __VERIFIER_nondet_ulong() [L98] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=0, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=0, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L98] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=0, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L99] CALL assume_abort_if_not(var_1_6 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L99] RET assume_abort_if_not(var_1_6 <= 4294967294) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L100] var_1_8 = __VERIFIER_nondet_float() [L101] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L101] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L102] var_1_14 = __VERIFIER_nondet_ulong() [L103] CALL assume_abort_if_not(var_1_14 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=6442450943, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=6442450943, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L103] RET assume_abort_if_not(var_1_14 >= 2147483647) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=6442450943, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L104] CALL assume_abort_if_not(var_1_14 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=6442450943, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=6442450943, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L104] RET assume_abort_if_not(var_1_14 <= 4294967295) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=6442450943, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L105] var_1_15 = __VERIFIER_nondet_ulong() [L106] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=6442450943, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=6442450943, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L106] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=6442450943, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L107] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=6442450943, var_1_15=0, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=6442450943, var_1_15=0, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L107] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=6442450943, var_1_15=0, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L108] var_1_16 = __VERIFIER_nondet_ulong() [L109] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=6442450943, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=6442450943, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L109] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=6442450943, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L110] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=6442450943, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=6442450943, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L110] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=6442450943, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L111] var_1_17 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=6442450943, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=6442450943, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L112] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=6442450943, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L113] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=6442450943, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=6442450943, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L113] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=6442450943, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L114] var_1_18 = __VERIFIER_nondet_uchar() [L115] CALL assume_abort_if_not(var_1_18 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=6442450943, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=6442450943, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L115] RET assume_abort_if_not(var_1_18 >= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=6442450943, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L116] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=6442450943, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=6442450943, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L116] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=6442450943, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L117] var_1_20 = __VERIFIER_nondet_ushort() [L118] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=6442450943, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=6442450943, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L118] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=6442450943, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L119] CALL assume_abort_if_not(var_1_20 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=6442450943, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=6442450943, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L119] RET assume_abort_if_not(var_1_20 <= 65535) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=6442450943, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L120] CALL assume_abort_if_not(var_1_20 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=6442450943, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=6442450943, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L120] RET assume_abort_if_not(var_1_20 != 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=6442450943, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L121] var_1_23 = __VERIFIER_nondet_char() [L122] CALL assume_abort_if_not(var_1_23 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=6442450943, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=6442450943, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L122] RET assume_abort_if_not(var_1_23 >= -127) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=6442450943, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L123] CALL assume_abort_if_not(var_1_23 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=6442450943, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=6442450943, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L123] RET assume_abort_if_not(var_1_23 <= 126) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=6442450943, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L137] RET updateVariables() [L138] CALL step() [L44] signed long int stepLocal_0 = last_1_var_1_9; VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_0=-50, var_1_13=1, var_1_14=6442450943, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L45] COND FALSE !(stepLocal_0 < last_1_var_1_9) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=6442450943, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L48] var_1_21 = var_1_6 [L49] var_1_22 = var_1_23 [L50] unsigned long int stepLocal_4 = 4256310412u - 128u; VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_4=4256310284, var_1_13=1, var_1_14=6442450943, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L51] COND FALSE !(var_1_4 >= stepLocal_4) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=6442450943, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L54] COND FALSE !((var_1_21 / ((((64u) < 0 ) ? -(64u) : (64u)))) == var_1_4) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=6442450943, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L57] signed long int stepLocal_3 = var_1_9; [L58] unsigned long int stepLocal_2 = (((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)); VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_2=0, stepLocal_3=-50, var_1_13=1, var_1_14=6442450943, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L59] EXPR var_1_21 ^ 4u VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_2=0, stepLocal_3=-50, var_1_13=1, var_1_14=6442450943, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L59] unsigned long int stepLocal_1 = var_1_21 ^ 4u; [L60] COND FALSE !(var_1_9 <= stepLocal_2) [L69] var_1_7 = var_1_8 VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=6442450943, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L71] COND FALSE !(var_1_21 >= (var_1_14 - ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) [L78] var_1_13 = var_1_18 VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=6442450943, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L80] signed long int stepLocal_5 = (var_1_22 / 2) / var_1_20; VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, stepLocal_5=0, var_1_13=1, var_1_14=6442450943, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L81] COND TRUE stepLocal_5 >= (~ 100) VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=6442450943, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L82] COND TRUE \read(var_1_13) [L83] var_1_19 = (var_1_17 && var_1_18) VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=6442450943, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L138] RET step() [L139] CALL, EXPR property() [L129] EXPR ((((var_1_21 / ((((64u) < 0 ) ? -(64u) : (64u)))) == var_1_4) ? (var_1_1 == ((double) (8.8 - 255.2))) : 1) && ((last_1_var_1_9 < last_1_var_1_9) ? (var_1_4 == ((unsigned long int) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : 1)) && ((var_1_9 <= ((((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)))) ? ((var_1_9 < var_1_5) ? ((var_1_9 >= (var_1_21 ^ 4u)) ? (var_1_7 == ((float) var_1_8)) : 1) : (var_1_7 == ((float) var_1_8))) : (var_1_7 == ((float) var_1_8))) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=6442450943, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L129] EXPR (var_1_9 <= ((((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)))) ? ((var_1_9 < var_1_5) ? ((var_1_9 >= (var_1_21 ^ 4u)) ? (var_1_7 == ((float) var_1_8)) : 1) : (var_1_7 == ((float) var_1_8))) : (var_1_7 == ((float) var_1_8)) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=6442450943, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L129] EXPR ((((var_1_21 / ((((64u) < 0 ) ? -(64u) : (64u)))) == var_1_4) ? (var_1_1 == ((double) (8.8 - 255.2))) : 1) && ((last_1_var_1_9 < last_1_var_1_9) ? (var_1_4 == ((unsigned long int) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : 1)) && ((var_1_9 <= ((((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)))) ? ((var_1_9 < var_1_5) ? ((var_1_9 >= (var_1_21 ^ 4u)) ? (var_1_7 == ((float) var_1_8)) : 1) : (var_1_7 == ((float) var_1_8))) : (var_1_7 == ((float) var_1_8))) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=6442450943, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L129-L130] return (((((((((var_1_21 / ((((64u) < 0 ) ? -(64u) : (64u)))) == var_1_4) ? (var_1_1 == ((double) (8.8 - 255.2))) : 1) && ((last_1_var_1_9 < last_1_var_1_9) ? (var_1_4 == ((unsigned long int) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : 1)) && ((var_1_9 <= ((((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)))) ? ((var_1_9 < var_1_5) ? ((var_1_9 >= (var_1_21 ^ 4u)) ? (var_1_7 == ((float) var_1_8)) : 1) : (var_1_7 == ((float) var_1_8))) : (var_1_7 == ((float) var_1_8)))) && ((var_1_4 >= (4256310412u - 128u)) ? (var_1_9 == ((signed long int) (((((var_1_22 + var_1_22) < 0 ) ? -(var_1_22 + var_1_22) : (var_1_22 + var_1_22))) + var_1_22))) : 1)) && ((var_1_21 >= (var_1_14 - ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) ? ((var_1_16 < var_1_9) ? (var_1_13 == ((unsigned char) var_1_17)) : (var_1_13 == ((unsigned char) var_1_17))) : (var_1_13 == ((unsigned char) var_1_18)))) && ((((var_1_22 / 2) / var_1_20) >= (~ 100)) ? (var_1_13 ? (var_1_19 == ((unsigned char) (var_1_17 && var_1_18))) : 1) : (var_1_17 ? (var_1_19 == ((unsigned char) var_1_18)) : (var_1_19 == ((unsigned char) var_1_18))))) && (var_1_21 == ((unsigned long int) var_1_6))) && (var_1_22 == ((signed char) var_1_23)) ; [L139] RET, EXPR property() [L139] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=6442450943, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=6442450943, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 79 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 6, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 338 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 338 mSDsluCounter, 1012 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 395 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 199 IncrementalHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 617 mSDtfsCounter, 199 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 238 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=5, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 101 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 935 NumberOfCodeBlocks, 935 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 660 ConstructedInterpolants, 0 QuantifiedInterpolants, 1000 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 3800/3800 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-11-12 06:50:14,023 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/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-61.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash 70761ec11e58c10698e5aa0cf29d007b987b034e5642b1a07232bb0cab676aec --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:50:16,425 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:50:16,493 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 06:50:16,499 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:50:16,503 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:50:16,535 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:50:16,536 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:50:16,537 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:50:16,537 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:50:16,537 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:50:16,538 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:50:16,538 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:50:16,538 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:50:16,538 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:50:16,539 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:50:16,539 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:50:16,542 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:50:16,543 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:50:16,544 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:50:16,544 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:50:16,544 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:50:16,544 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:50:16,545 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:50:16,545 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 06:50:16,546 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 06:50:16,546 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:50:16,546 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 06:50:16,546 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:50:16,546 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:50:16,547 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:50:16,547 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:50:16,547 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:50:16,547 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:50:16,549 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:50:16,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:50:16,549 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:50:16,549 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:50:16,550 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:50:16,550 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 06:50:16,550 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 06:50:16,550 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:50:16,551 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:50:16,551 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:50:16,551 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:50:16,552 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 70761ec11e58c10698e5aa0cf29d007b987b034e5642b1a07232bb0cab676aec [2024-11-12 06:50:16,875 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:50:16,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:50:16,910 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:50:16,911 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:50:16,911 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:50:16,912 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-61.i [2024-11-12 06:50:18,404 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:50:18,600 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:50:18,600 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-61.i [2024-11-12 06:50:18,619 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23d2242a1/699ebc23a2a94e83b8d933a71d44a918/FLAG0267d447b [2024-11-12 06:50:18,632 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23d2242a1/699ebc23a2a94e83b8d933a71d44a918 [2024-11-12 06:50:18,634 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:50:18,635 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:50:18,637 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:50:18,637 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:50:18,641 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:50:18,642 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:50:18" (1/1) ... [2024-11-12 06:50:18,643 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79eda00f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:50:18, skipping insertion in model container [2024-11-12 06:50:18,643 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:50:18" (1/1) ... [2024-11-12 06:50:18,666 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:50:18,877 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-61.i[915,928] [2024-11-12 06:50:18,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:50:18,964 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:50:18,975 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-61.i[915,928] [2024-11-12 06:50:19,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:50:19,024 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:50:19,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:50:19 WrapperNode [2024-11-12 06:50:19,025 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:50:19,026 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:50:19,026 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:50:19,026 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:50:19,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:50:19" (1/1) ... [2024-11-12 06:50:19,046 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:50:19" (1/1) ... [2024-11-12 06:50:19,071 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 135 [2024-11-12 06:50:19,072 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:50:19,076 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:50:19,076 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:50:19,076 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:50:19,084 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:50:19" (1/1) ... [2024-11-12 06:50:19,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:50:19" (1/1) ... [2024-11-12 06:50:19,088 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:50:19" (1/1) ... [2024-11-12 06:50:19,101 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-11-12 06:50:19,102 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:50:19" (1/1) ... [2024-11-12 06:50:19,102 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:50:19" (1/1) ... [2024-11-12 06:50:19,114 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:50:19" (1/1) ... [2024-11-12 06:50:19,119 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:50:19" (1/1) ... [2024-11-12 06:50:19,121 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:50:19" (1/1) ... [2024-11-12 06:50:19,121 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:50:19" (1/1) ... [2024-11-12 06:50:19,128 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:50:19,130 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:50:19,130 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:50:19,130 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:50:19,130 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:50:19" (1/1) ... [2024-11-12 06:50:19,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:50:19,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:50:19,155 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-11-12 06:50:19,157 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-11-12 06:50:19,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:50:19,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 06:50:19,196 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:50:19,196 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:50:19,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:50:19,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:50:19,279 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:50:19,281 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:50:19,733 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-12 06:50:19,733 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:50:19,753 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:50:19,759 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:50:19,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:50:19 BoogieIcfgContainer [2024-11-12 06:50:19,760 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:50:19,761 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:50:19,761 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:50:19,770 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:50:19,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:50:18" (1/3) ... [2024-11-12 06:50:19,774 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@417b310 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:50:19, skipping insertion in model container [2024-11-12 06:50:19,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:50:19" (2/3) ... [2024-11-12 06:50:19,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@417b310 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:50:19, skipping insertion in model container [2024-11-12 06:50:19,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:50:19" (3/3) ... [2024-11-12 06:50:19,777 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-61.i [2024-11-12 06:50:19,795 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:50:19,795 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:50:19,867 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:50:19,875 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;@23f3167b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:50:19,877 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:50:19,880 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 40 states have (on average 1.4) internal successors, (56), 41 states have internal predecessors, (56), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 06:50:19,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-12 06:50:19,889 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:50:19,890 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 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-11-12 06:50:19,890 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:50:19,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:50:19,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1292719543, now seen corresponding path program 1 times [2024-11-12 06:50:19,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:50:19,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [539227004] [2024-11-12 06:50:19,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:50:19,911 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-11-12 06:50:19,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:50:19,915 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-11-12 06:50:19,916 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-11-12 06:50:20,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:20,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 06:50:20,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:50:20,217 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 318 proven. 0 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2024-11-12 06:50:20,218 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 06:50:20,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:50:20,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [539227004] [2024-11-12 06:50:20,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [539227004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:50:20,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:50:20,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:50:20,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478279844] [2024-11-12 06:50:20,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:50:20,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 06:50:20,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:50:20,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 06:50:20,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:50:20,269 INFO L87 Difference]: Start difference. First operand has 63 states, 40 states have (on average 1.4) internal successors, (56), 41 states have internal predecessors, (56), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 06:50:20,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:50:20,338 INFO L93 Difference]: Finished difference Result 119 states and 206 transitions. [2024-11-12 06:50:20,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 06:50:20,344 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 129 [2024-11-12 06:50:20,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:50:20,357 INFO L225 Difference]: With dead ends: 119 [2024-11-12 06:50:20,361 INFO L226 Difference]: Without dead ends: 59 [2024-11-12 06:50:20,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:50:20,373 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:50:20,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:50:20,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-12 06:50:20,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-12 06:50:20,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 06:50:20,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 89 transitions. [2024-11-12 06:50:20,471 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 89 transitions. Word has length 129 [2024-11-12 06:50:20,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:50:20,473 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 89 transitions. [2024-11-12 06:50:20,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 06:50:20,474 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 89 transitions. [2024-11-12 06:50:20,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-12 06:50:20,484 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:50:20,484 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 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-11-12 06:50:20,502 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 (2)] Ended with exit code 0 [2024-11-12 06:50:20,686 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-11-12 06:50:20,687 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:50:20,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:50:20,687 INFO L85 PathProgramCache]: Analyzing trace with hash 283948599, now seen corresponding path program 1 times [2024-11-12 06:50:20,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:50:20,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [993686522] [2024-11-12 06:50:20,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:50:20,688 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-11-12 06:50:20,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:50:20,706 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-11-12 06:50:20,717 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-11-12 06:50:20,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:20,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 06:50:20,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:50:21,258 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 06:50:21,258 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 06:50:21,258 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:50:21,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [993686522] [2024-11-12 06:50:21,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [993686522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:50:21,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:50:21,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 06:50:21,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344351929] [2024-11-12 06:50:21,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:50:21,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 06:50:21,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:50:21,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 06:50:21,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 06:50:21,261 INFO L87 Difference]: Start difference. First operand 59 states and 89 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 06:50:21,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:50:21,733 INFO L93 Difference]: Finished difference Result 189 states and 288 transitions. [2024-11-12 06:50:21,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 06:50:21,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 129 [2024-11-12 06:50:21,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:50:21,745 INFO L225 Difference]: With dead ends: 189 [2024-11-12 06:50:21,745 INFO L226 Difference]: Without dead ends: 133 [2024-11-12 06:50:21,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-12 06:50:21,747 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 76 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 06:50:21,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 321 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 06:50:21,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-12 06:50:21,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 113. [2024-11-12 06:50:21,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 70 states have internal predecessors, (93), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-12 06:50:21,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 173 transitions. [2024-11-12 06:50:21,767 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 173 transitions. Word has length 129 [2024-11-12 06:50:21,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:50:21,767 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 173 transitions. [2024-11-12 06:50:21,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 06:50:21,768 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 173 transitions. [2024-11-12 06:50:21,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-12 06:50:21,769 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:50:21,769 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 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-11-12 06:50:21,778 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-11-12 06:50:21,973 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-11-12 06:50:21,974 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:50:21,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:50:21,975 INFO L85 PathProgramCache]: Analyzing trace with hash -727168651, now seen corresponding path program 1 times [2024-11-12 06:50:21,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:50:21,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1607967407] [2024-11-12 06:50:21,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:50:21,976 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-11-12 06:50:21,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:50:21,978 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-11-12 06:50:21,982 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-11-12 06:50:22,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:22,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 06:50:22,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:50:22,410 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 06:50:22,411 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 06:50:22,411 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:50:22,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1607967407] [2024-11-12 06:50:22,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1607967407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:50:22,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:50:22,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 06:50:22,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31220343] [2024-11-12 06:50:22,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:50:22,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 06:50:22,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:50:22,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 06:50:22,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 06:50:22,413 INFO L87 Difference]: Start difference. First operand 113 states and 173 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 06:50:22,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:50:22,721 INFO L93 Difference]: Finished difference Result 115 states and 174 transitions. [2024-11-12 06:50:22,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 06:50:22,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 129 [2024-11-12 06:50:22,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:50:22,731 INFO L225 Difference]: With dead ends: 115 [2024-11-12 06:50:22,731 INFO L226 Difference]: Without dead ends: 59 [2024-11-12 06:50:22,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 06:50:22,732 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 27 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 06:50:22,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 123 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 06:50:22,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-12 06:50:22,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-12 06:50:22,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 states have internal predecessors, (47), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 06:50:22,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 87 transitions. [2024-11-12 06:50:22,743 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 87 transitions. Word has length 129 [2024-11-12 06:50:22,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:50:22,743 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 87 transitions. [2024-11-12 06:50:22,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 06:50:22,744 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 87 transitions. [2024-11-12 06:50:22,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-12 06:50:22,745 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:50:22,745 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 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-11-12 06:50:22,758 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 (4)] Forceful destruction successful, exit code 0 [2024-11-12 06:50:22,949 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-11-12 06:50:22,950 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:50:22,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:50:22,951 INFO L85 PathProgramCache]: Analyzing trace with hash -469003213, now seen corresponding path program 1 times [2024-11-12 06:50:22,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:50:22,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1982564500] [2024-11-12 06:50:22,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:50:22,952 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-11-12 06:50:22,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:50:22,954 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-11-12 06:50:22,963 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-11-12 06:50:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:50:23,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-12 06:50:23,147 INFO L279 TraceCheckSpWp]: Computing forward predicates...