./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-91.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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_loopvsstraightlinecode_50-while_file-91.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 2d8b2be6d6ac251f6f2682006f5d119ef2b6d6ee8107fbc3310af784e3db17b0 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:19:45,183 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:19:45,256 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 00:19:45,262 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:19:45,264 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:19:45,292 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:19:45,293 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:19:45,294 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:19:45,294 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:19:45,295 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:19:45,295 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:19:45,295 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:19:45,296 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:19:45,296 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:19:45,297 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:19:45,297 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:19:45,298 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:19:45,298 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:19:45,299 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:19:45,299 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:19:45,299 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:19:45,304 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:19:45,304 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:19:45,304 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:19:45,305 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:19:45,305 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:19:45,305 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:19:45,306 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:19:45,306 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:19:45,307 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:19:45,307 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:19:45,307 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:19:45,308 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:19:45,308 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:19:45,309 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:19:45,309 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:19:45,310 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 00:19:45,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:19:45,310 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:19:45,311 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:19:45,311 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:19:45,312 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:19:45,312 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 -> 2d8b2be6d6ac251f6f2682006f5d119ef2b6d6ee8107fbc3310af784e3db17b0 [2024-11-09 00:19:45,579 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:19:45,610 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:19:45,613 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:19:45,615 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:19:45,615 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:19:45,617 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-91.i [2024-11-09 00:19:47,227 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:19:47,436 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:19:47,437 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-91.i [2024-11-09 00:19:47,452 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4610fb48f/30a3eb651b094d8fb8c449c0b38b3caf/FLAG85a600643 [2024-11-09 00:19:47,471 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4610fb48f/30a3eb651b094d8fb8c449c0b38b3caf [2024-11-09 00:19:47,475 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:19:47,477 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:19:47,480 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:19:47,480 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:19:47,486 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:19:47,489 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:19:47" (1/1) ... [2024-11-09 00:19:47,491 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38878f0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:47, skipping insertion in model container [2024-11-09 00:19:47,491 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:19:47" (1/1) ... [2024-11-09 00:19:47,526 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:19:47,711 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_loopvsstraightlinecode_50-while_file-91.i[915,928] [2024-11-09 00:19:47,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:19:47,799 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:19:47,812 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_loopvsstraightlinecode_50-while_file-91.i[915,928] [2024-11-09 00:19:47,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:19:47,909 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:19:47,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:47 WrapperNode [2024-11-09 00:19:47,910 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:19:47,912 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:19:47,912 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:19:47,912 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:19:47,920 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:47" (1/1) ... [2024-11-09 00:19:47,938 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:47" (1/1) ... [2024-11-09 00:19:47,981 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 148 [2024-11-09 00:19:47,982 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:19:47,983 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:19:47,983 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:19:47,983 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:19:47,999 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:47" (1/1) ... [2024-11-09 00:19:48,000 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:47" (1/1) ... [2024-11-09 00:19:48,005 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:47" (1/1) ... [2024-11-09 00:19:48,032 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-09 00:19:48,033 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:47" (1/1) ... [2024-11-09 00:19:48,033 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:47" (1/1) ... [2024-11-09 00:19:48,048 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:47" (1/1) ... [2024-11-09 00:19:48,064 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:47" (1/1) ... [2024-11-09 00:19:48,066 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:47" (1/1) ... [2024-11-09 00:19:48,073 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:47" (1/1) ... [2024-11-09 00:19:48,079 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:19:48,083 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:19:48,083 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:19:48,084 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:19:48,085 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:47" (1/1) ... [2024-11-09 00:19:48,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:19:48,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:19:48,131 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-09 00:19:48,135 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-09 00:19:48,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:19:48,188 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:19:48,189 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:19:48,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 00:19:48,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:19:48,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:19:48,294 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:19:48,300 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:19:48,671 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-09 00:19:48,672 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:19:48,692 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:19:48,693 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:19:48,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:19:48 BoogieIcfgContainer [2024-11-09 00:19:48,694 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:19:48,697 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:19:48,698 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:19:48,702 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:19:48,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:19:47" (1/3) ... [2024-11-09 00:19:48,704 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39927897 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:19:48, skipping insertion in model container [2024-11-09 00:19:48,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:47" (2/3) ... [2024-11-09 00:19:48,705 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39927897 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:19:48, skipping insertion in model container [2024-11-09 00:19:48,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:19:48" (3/3) ... [2024-11-09 00:19:48,708 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-91.i [2024-11-09 00:19:48,728 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:19:48,729 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:19:48,796 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:19:48,806 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;@7e4cce73, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:19:48,807 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:19:48,814 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 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-09 00:19:48,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-09 00:19:48,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:19:48,833 INFO L215 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] [2024-11-09 00:19:48,833 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:19:48,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:19:48,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1703649485, now seen corresponding path program 1 times [2024-11-09 00:19:48,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:19:48,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90694767] [2024-11-09 00:19:48,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:19:48,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:19:49,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:49,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:19:49,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:49,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:19:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:49,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:19:49,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:49,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:19:49,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:49,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:19:49,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:49,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:19:49,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:49,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:19:49,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:49,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:19:49,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:49,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:19:49,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:49,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:19:49,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:49,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:19:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:49,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:19:49,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:49,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:19:49,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:49,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:19:49,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:49,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 00:19:49,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:49,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:19:49,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:49,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 00:19:49,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:49,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 00:19:49,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:49,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 00:19:49,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:49,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 00:19:49,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:49,399 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-09 00:19:49,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:19:49,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90694767] [2024-11-09 00:19:49,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90694767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:19:49,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:19:49,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:19:49,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604851231] [2024-11-09 00:19:49,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:19:49,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:19:49,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:19:49,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:19:49,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:19:49,441 INFO L87 Difference]: Start difference. First operand has 64 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 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 16.5) internal successors, (33), 2 states have internal predecessors, (33), 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-09 00:19:49,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:19:49,478 INFO L93 Difference]: Finished difference Result 121 states and 206 transitions. [2024-11-09 00:19:49,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:19:49,481 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 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 130 [2024-11-09 00:19:49,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:19:49,490 INFO L225 Difference]: With dead ends: 121 [2024-11-09 00:19:49,490 INFO L226 Difference]: Without dead ends: 60 [2024-11-09 00:19:49,495 INFO L431 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-09 00:19:49,503 INFO L432 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-09 00:19:49,505 INFO L433 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-09 00:19:49,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-09 00:19:49,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-09 00:19:49,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 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-09 00:19:49,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 89 transitions. [2024-11-09 00:19:49,564 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 89 transitions. Word has length 130 [2024-11-09 00:19:49,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:19:49,565 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 89 transitions. [2024-11-09 00:19:49,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 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-09 00:19:49,567 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 89 transitions. [2024-11-09 00:19:49,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-09 00:19:49,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:19:49,573 INFO L215 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] [2024-11-09 00:19:49,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 00:19:49,573 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:19:49,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:19:49,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1779092471, now seen corresponding path program 1 times [2024-11-09 00:19:49,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:19:49,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113729936] [2024-11-09 00:19:49,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:19:49,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:19:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:49,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:19:49,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:49,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:19:49,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:49,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:19:49,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:49,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:19:49,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:49,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:19:49,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:49,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:19:49,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:49,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:19:49,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:49,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:19:49,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:49,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:19:50,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:50,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:19:50,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:50,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:19:50,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:50,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:19:50,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:50,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:19:50,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:50,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:19:50,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:50,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 00:19:50,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:50,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:19:50,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:50,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 00:19:50,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:50,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 00:19:50,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:50,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 00:19:50,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:50,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 00:19:50,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:50,093 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-09 00:19:50,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:19:50,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113729936] [2024-11-09 00:19:50,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113729936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:19:50,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:19:50,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 00:19:50,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843944582] [2024-11-09 00:19:50,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:19:50,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 00:19:50,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:19:50,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 00:19:50,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 00:19:50,101 INFO L87 Difference]: Start difference. First operand 60 states and 89 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-09 00:19:50,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:19:50,178 INFO L93 Difference]: Finished difference Result 171 states and 255 transitions. [2024-11-09 00:19:50,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 00:19:50,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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 130 [2024-11-09 00:19:50,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:19:50,182 INFO L225 Difference]: With dead ends: 171 [2024-11-09 00:19:50,182 INFO L226 Difference]: Without dead ends: 114 [2024-11-09 00:19:50,185 INFO L431 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-09 00:19:50,187 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 79 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:19:50,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 242 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:19:50,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-09 00:19:50,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 62. [2024-11-09 00:19:50,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 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-09 00:19:50,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 91 transitions. [2024-11-09 00:19:50,215 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 91 transitions. Word has length 130 [2024-11-09 00:19:50,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:19:50,218 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 91 transitions. [2024-11-09 00:19:50,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-09 00:19:50,218 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 91 transitions. [2024-11-09 00:19:50,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-09 00:19:50,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:19:50,221 INFO L215 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] [2024-11-09 00:19:50,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 00:19:50,222 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:19:50,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:19:50,223 INFO L85 PathProgramCache]: Analyzing trace with hash 235972954, now seen corresponding path program 1 times [2024-11-09 00:19:50,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:19:50,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063034387] [2024-11-09 00:19:50,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:19:50,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:19:50,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:50,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:19:50,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:50,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:19:50,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:50,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:19:50,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:50,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:19:50,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:50,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:19:50,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:50,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:19:50,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:50,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:19:50,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:50,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:19:50,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:50,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:19:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:50,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:19:50,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:50,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:19:50,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:50,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:19:50,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:50,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:19:50,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:50,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:19:50,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:50,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 00:19:50,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:50,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:19:50,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:50,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 00:19:50,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:50,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 00:19:50,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:50,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 00:19:50,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:50,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 00:19:50,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:50,957 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-09 00:19:50,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:19:50,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063034387] [2024-11-09 00:19:50,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063034387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:19:50,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:19:50,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 00:19:50,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994827820] [2024-11-09 00:19:50,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:19:50,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 00:19:50,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:19:50,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 00:19:50,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 00:19:50,963 INFO L87 Difference]: Start difference. First operand 62 states and 91 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:19:51,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:19:51,538 INFO L93 Difference]: Finished difference Result 178 states and 256 transitions. [2024-11-09 00:19:51,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 00:19:51,539 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 131 [2024-11-09 00:19:51,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:19:51,542 INFO L225 Difference]: With dead ends: 178 [2024-11-09 00:19:51,542 INFO L226 Difference]: Without dead ends: 119 [2024-11-09 00:19:51,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2024-11-09 00:19:51,544 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 106 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 00:19:51,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 284 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 00:19:51,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-09 00:19:51,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 63. [2024-11-09 00:19:51,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 40 states have (on average 1.2) internal successors, (48), 40 states have internal predecessors, (48), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 00:19:51,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 88 transitions. [2024-11-09 00:19:51,560 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 88 transitions. Word has length 131 [2024-11-09 00:19:51,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:19:51,561 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 88 transitions. [2024-11-09 00:19:51,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:19:51,561 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 88 transitions. [2024-11-09 00:19:51,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-09 00:19:51,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:19:51,563 INFO L215 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] [2024-11-09 00:19:51,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 00:19:51,564 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:19:51,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:19:51,565 INFO L85 PathProgramCache]: Analyzing trace with hash -836746247, now seen corresponding path program 1 times [2024-11-09 00:19:51,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:19:51,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692889627] [2024-11-09 00:19:51,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:19:51,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:19:51,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 00:19:51,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1572984335] [2024-11-09 00:19:51,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:19:51,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:19:51,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:19:51,640 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-09 00:19:51,641 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-09 00:19:51,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:19:51,899 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:19:51,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:19:52,030 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 00:19:52,031 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 00:19:52,032 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 00:19:52,047 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-09 00:19:52,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:19:52,239 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-09 00:19:52,355 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 00:19:52,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:19:52 BoogieIcfgContainer [2024-11-09 00:19:52,359 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 00:19:52,360 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:19:52,360 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:19:52,361 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:19:52,361 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:19:48" (3/4) ... [2024-11-09 00:19:52,364 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 00:19:52,366 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:19:52,366 INFO L158 Benchmark]: Toolchain (without parser) took 4889.55ms. Allocated memory was 167.8MB in the beginning and 213.9MB in the end (delta: 46.1MB). Free memory was 98.3MB in the beginning and 91.9MB in the end (delta: 6.4MB). Peak memory consumption was 53.7MB. Max. memory is 16.1GB. [2024-11-09 00:19:52,368 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 167.8MB. Free memory is still 120.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:19:52,368 INFO L158 Benchmark]: CACSL2BoogieTranslator took 430.91ms. Allocated memory was 167.8MB in the beginning and 213.9MB in the end (delta: 46.1MB). Free memory was 98.1MB in the beginning and 185.2MB in the end (delta: -87.1MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2024-11-09 00:19:52,369 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.29ms. Allocated memory is still 213.9MB. Free memory was 185.2MB in the beginning and 181.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 00:19:52,370 INFO L158 Benchmark]: Boogie Preprocessor took 99.33ms. Allocated memory is still 213.9MB. Free memory was 181.1MB in the beginning and 173.7MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 00:19:52,370 INFO L158 Benchmark]: RCFGBuilder took 611.20ms. Allocated memory is still 213.9MB. Free memory was 173.7MB in the beginning and 149.6MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-09 00:19:52,371 INFO L158 Benchmark]: TraceAbstraction took 3662.24ms. Allocated memory is still 213.9MB. Free memory was 149.6MB in the beginning and 92.9MB in the end (delta: 56.7MB). Peak memory consumption was 56.7MB. Max. memory is 16.1GB. [2024-11-09 00:19:52,371 INFO L158 Benchmark]: Witness Printer took 5.56ms. Allocated memory is still 213.9MB. Free memory was 92.9MB in the beginning and 91.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:19:52,373 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.26ms. Allocated memory is still 167.8MB. Free memory is still 120.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 430.91ms. Allocated memory was 167.8MB in the beginning and 213.9MB in the end (delta: 46.1MB). Free memory was 98.1MB in the beginning and 185.2MB in the end (delta: -87.1MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.29ms. Allocated memory is still 213.9MB. Free memory was 185.2MB in the beginning and 181.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 99.33ms. Allocated memory is still 213.9MB. Free memory was 181.1MB in the beginning and 173.7MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 611.20ms. Allocated memory is still 213.9MB. Free memory was 173.7MB in the beginning and 149.6MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3662.24ms. Allocated memory is still 213.9MB. Free memory was 149.6MB in the beginning and 92.9MB in the end (delta: 56.7MB). Peak memory consumption was 56.7MB. Max. memory is 16.1GB. * Witness Printer took 5.56ms. Allocated memory is still 213.9MB. Free memory was 92.9MB in the beginning and 91.9MB in the end (delta: 1.0MB). 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 133, overapproximation of someBinaryArithmeticFLOAToperation at line 67. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -64; [L23] signed short int var_1_5 = 8; [L24] signed short int var_1_6 = 8; [L25] signed short int var_1_7 = 5; [L26] signed short int var_1_8 = 0; [L27] signed char var_1_9 = 5; [L28] signed char var_1_11 = 16; [L29] signed short int var_1_12 = 25; [L30] signed short int var_1_13 = 64; [L31] unsigned char var_1_15 = 1; [L32] unsigned char var_1_16 = 16; [L33] float var_1_17 = 1.2; [L34] float var_1_18 = 5.8; [L35] float var_1_19 = 10.25; [L36] float var_1_20 = 2.5; [L37] signed short int var_1_21 = 200; [L38] unsigned char var_1_24 = 1; [L39] unsigned char var_1_25 = 0; [L40] signed char var_1_26 = -5; [L41] signed short int last_1_var_1_1 = -64; [L42] signed short int last_1_var_1_13 = 64; [L43] unsigned char last_1_var_1_15 = 1; [L44] signed char last_1_var_1_26 = -5; VAL [isInitial=0, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=8, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L137] isInitial = 1 [L138] FCALL initially() [L139] COND TRUE 1 [L140] CALL updateLastVariables() [L127] last_1_var_1_1 = var_1_1 [L128] last_1_var_1_13 = var_1_13 [L129] last_1_var_1_15 = var_1_15 [L130] last_1_var_1_26 = var_1_26 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=8, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L140] RET updateLastVariables() [L141] CALL updateVariables() [L94] var_1_5 = __VERIFIER_nondet_short() [L95] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L95] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L96] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L96] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=8, var_1_7=5, var_1_8=0, var_1_9=5] [L97] var_1_6 = __VERIFIER_nondet_short() [L98] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=5, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=5, var_1_8=0, var_1_9=5] [L98] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=5, var_1_8=0, var_1_9=5] [L99] CALL assume_abort_if_not(var_1_6 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=5, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=5, var_1_8=0, var_1_9=5] [L99] RET assume_abort_if_not(var_1_6 <= 16383) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=5, var_1_8=0, var_1_9=5] [L100] var_1_7 = __VERIFIER_nondet_short() [L101] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L101] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L102] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L102] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L103] var_1_8 = __VERIFIER_nondet_short() [L104] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L104] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L105] CALL assume_abort_if_not(var_1_8 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L105] RET assume_abort_if_not(var_1_8 <= 16383) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=16, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L106] var_1_11 = __VERIFIER_nondet_char() [L107] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L107] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L108] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L108] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=25, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L109] var_1_12 = __VERIFIER_nondet_short() [L110] CALL assume_abort_if_not(var_1_12 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L110] RET assume_abort_if_not(var_1_12 >= -32768) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L111] CALL assume_abort_if_not(var_1_12 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L111] RET assume_abort_if_not(var_1_12 <= 32767) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L112] CALL assume_abort_if_not(var_1_12 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L112] RET assume_abort_if_not(var_1_12 != 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=16, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L113] var_1_16 = __VERIFIER_nondet_uchar() [L114] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L114] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L115] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L115] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_18=29/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L116] var_1_18 = __VERIFIER_nondet_float() [L117] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L117] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_19=41/4, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L118] var_1_19 = __VERIFIER_nondet_float() [L119] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L119] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_20=5/2, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L120] var_1_20 = __VERIFIER_nondet_float() [L121] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L121] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L122] var_1_25 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L123] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L124] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L124] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L141] RET updateVariables() [L142] CALL step() [L48] COND FALSE !(last_1_var_1_13 == last_1_var_1_1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L55] signed long int stepLocal_3 = (var_1_6 + var_1_8) - var_1_5; [L56] signed short int stepLocal_2 = var_1_1; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, stepLocal_2=-64, stepLocal_3=0, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=1, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L57] COND FALSE !(var_1_11 < stepLocal_2) [L64] var_1_15 = var_1_16 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, stepLocal_3=0, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=6/5, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L66] COND TRUE var_1_11 < 5 [L67] var_1_17 = ((((var_1_18) > ((var_1_19 - var_1_20))) ? (var_1_18) : ((var_1_19 - var_1_20)))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, stepLocal_3=0, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=200, var_1_24=1, var_1_25=0, var_1_26=-5, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L69] var_1_24 = var_1_25 [L70] var_1_26 = var_1_11 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, stepLocal_3=0, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=200, var_1_24=0, var_1_25=0, var_1_26=-64, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L71] COND FALSE !(\read(var_1_24)) [L76] var_1_21 = (var_1_15 - 2) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, stepLocal_3=0, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=-2, var_1_24=0, var_1_25=0, var_1_26=-64, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L78] unsigned char stepLocal_0 = var_1_15; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, stepLocal_0=0, stepLocal_3=0, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=-2, var_1_24=0, var_1_25=0, var_1_26=-64, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L79] COND FALSE !(\read(var_1_24)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, stepLocal_0=0, stepLocal_3=0, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=-2, var_1_24=0, var_1_25=0, var_1_26=-64, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=5] [L82] COND TRUE stepLocal_0 <= (var_1_21 / var_1_12) [L83] var_1_9 = var_1_11 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, stepLocal_3=0, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=-2, var_1_24=0, var_1_25=0, var_1_26=-64, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-64] [L88] signed long int stepLocal_1 = var_1_1 * (var_1_15 % var_1_12); VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, stepLocal_1=0, stepLocal_3=0, var_1_11=-64, var_1_12=-2, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=-2, var_1_24=0, var_1_25=0, var_1_26=-64, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-64] [L89] COND TRUE (- var_1_15) >= stepLocal_1 [L90] var_1_13 = var_1_26 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, stepLocal_3=0, var_1_11=-64, var_1_12=-2, var_1_13=-64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=-2, var_1_24=0, var_1_25=0, var_1_26=-64, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-64] [L142] RET step() [L143] CALL, EXPR property() [L133-L134] return ((((((((last_1_var_1_13 == last_1_var_1_1) ? ((last_1_var_1_1 <= ((((last_1_var_1_13) > (last_1_var_1_26)) ? (last_1_var_1_13) : (last_1_var_1_26)))) ? (var_1_1 == ((signed short int) (last_1_var_1_1 + (((((last_1_var_1_15 - last_1_var_1_15)) < ((last_1_var_1_15 - last_1_var_1_15))) ? ((last_1_var_1_15 - last_1_var_1_15)) : ((last_1_var_1_15 - last_1_var_1_15))))))) : (var_1_1 == ((signed short int) (((((last_1_var_1_15 - last_1_var_1_15)) < (((last_1_var_1_15 - last_1_var_1_15) + -256))) ? ((last_1_var_1_15 - last_1_var_1_15)) : (((last_1_var_1_15 - last_1_var_1_15) + -256))))))) : 1) && (var_1_24 ? (var_1_9 == ((signed char) var_1_11)) : ((var_1_15 <= (var_1_21 / var_1_12)) ? (var_1_9 == ((signed char) var_1_11)) : (var_1_9 == ((signed char) var_1_11))))) && (((- var_1_15) >= (var_1_1 * (var_1_15 % var_1_12))) ? (var_1_13 == ((signed short int) var_1_26)) : 1)) && ((var_1_11 < var_1_1) ? ((var_1_7 == ((var_1_6 + var_1_8) - var_1_5)) ? (var_1_15 == ((unsigned char) var_1_16)) : (var_1_15 == ((unsigned char) var_1_16))) : (var_1_15 == ((unsigned char) var_1_16)))) && ((var_1_11 < 5) ? (var_1_17 == ((float) ((((var_1_18) > ((var_1_19 - var_1_20))) ? (var_1_18) : ((var_1_19 - var_1_20)))))) : 1)) && (var_1_24 ? ((var_1_24 && var_1_24) ? (var_1_21 == ((signed short int) var_1_15)) : 1) : (var_1_21 == ((signed short int) (var_1_15 - 2))))) && (var_1_24 == ((unsigned char) var_1_25))) && (var_1_26 == ((signed char) var_1_11)) ; VAL [\result=0, isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=-64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=-2, var_1_24=0, var_1_25=0, var_1_26=-64, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-64] [L143] RET, EXPR property() [L143] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=-64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=-2, var_1_24=0, var_1_25=0, var_1_26=-64, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-64] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_15=1, last_1_var_1_1=-64, last_1_var_1_26=-5, var_1_11=-64, var_1_12=-2, var_1_13=-64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_1=-64, var_1_21=-2, var_1_24=0, var_1_25=0, var_1_26=-64, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=-64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 64 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 4, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 205 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 185 mSDsluCounter, 615 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 256 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 266 IncrementalHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 359 mSDtfsCounter, 266 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 163 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=0, InterpolantAutomatonStates: 22, 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, 3 MinimizatonAttempts, 108 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 653 NumberOfCodeBlocks, 653 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 388 ConstructedInterpolants, 0 QuantifiedInterpolants, 432 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2280/2280 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-09 00:19:52,413 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_loopvsstraightlinecode_50-while_file-91.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 2d8b2be6d6ac251f6f2682006f5d119ef2b6d6ee8107fbc3310af784e3db17b0 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:19:54,804 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:19:54,905 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 00:19:54,909 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:19:54,910 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:19:54,946 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:19:54,947 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:19:54,947 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:19:54,948 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:19:54,950 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:19:54,952 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:19:54,952 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:19:54,953 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:19:54,954 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:19:54,954 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:19:54,955 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:19:54,956 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:19:54,956 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:19:54,959 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:19:54,959 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:19:54,959 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:19:54,960 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:19:54,960 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:19:54,960 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 00:19:54,963 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 00:19:54,963 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:19:54,963 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 00:19:54,963 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:19:54,964 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:19:54,964 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:19:54,965 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:19:54,965 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:19:54,965 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:19:54,967 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:19:54,967 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:19:54,967 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:19:54,967 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:19:54,967 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:19:54,968 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 00:19:54,968 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 00:19:54,969 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:19:54,969 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:19:54,970 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:19:54,970 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:19:54,970 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 -> 2d8b2be6d6ac251f6f2682006f5d119ef2b6d6ee8107fbc3310af784e3db17b0 [2024-11-09 00:19:55,375 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:19:55,403 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:19:55,408 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:19:55,409 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:19:55,410 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:19:55,411 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-91.i [2024-11-09 00:19:57,239 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:19:57,462 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:19:57,463 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-91.i [2024-11-09 00:19:57,478 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75809433a/1e6deced64ec4e68af2808421a207cd8/FLAG3836b1f56 [2024-11-09 00:19:57,495 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75809433a/1e6deced64ec4e68af2808421a207cd8 [2024-11-09 00:19:57,499 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:19:57,500 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:19:57,503 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:19:57,503 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:19:57,510 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:19:57,510 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:19:57" (1/1) ... [2024-11-09 00:19:57,511 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d610139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:57, skipping insertion in model container [2024-11-09 00:19:57,512 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:19:57" (1/1) ... [2024-11-09 00:19:57,545 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:19:57,769 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_loopvsstraightlinecode_50-while_file-91.i[915,928] [2024-11-09 00:19:57,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:19:57,884 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:19:57,900 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_loopvsstraightlinecode_50-while_file-91.i[915,928] [2024-11-09 00:19:57,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:19:57,973 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:19:57,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:57 WrapperNode [2024-11-09 00:19:57,974 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:19:57,975 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:19:57,976 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:19:57,976 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:19:57,982 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:57" (1/1) ... [2024-11-09 00:19:58,001 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:57" (1/1) ... [2024-11-09 00:19:58,039 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 142 [2024-11-09 00:19:58,043 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:19:58,044 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:19:58,044 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:19:58,044 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:19:58,060 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:57" (1/1) ... [2024-11-09 00:19:58,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:57" (1/1) ... [2024-11-09 00:19:58,066 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:57" (1/1) ... [2024-11-09 00:19:58,084 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-09 00:19:58,088 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:57" (1/1) ... [2024-11-09 00:19:58,089 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:57" (1/1) ... [2024-11-09 00:19:58,106 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:57" (1/1) ... [2024-11-09 00:19:58,110 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:57" (1/1) ... [2024-11-09 00:19:58,116 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:57" (1/1) ... [2024-11-09 00:19:58,118 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:57" (1/1) ... [2024-11-09 00:19:58,126 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:19:58,130 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:19:58,130 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:19:58,130 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:19:58,131 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:57" (1/1) ... [2024-11-09 00:19:58,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:19:58,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:19:58,171 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-09 00:19:58,179 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-09 00:19:58,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:19:58,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 00:19:58,225 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:19:58,225 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:19:58,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:19:58,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:19:58,318 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:19:58,320 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:19:58,962 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-09 00:19:58,962 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:19:58,977 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:19:58,977 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:19:58,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:19:58 BoogieIcfgContainer [2024-11-09 00:19:58,977 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:19:58,982 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:19:58,982 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:19:58,986 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:19:58,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:19:57" (1/3) ... [2024-11-09 00:19:58,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4719b385 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:19:58, skipping insertion in model container [2024-11-09 00:19:58,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:57" (2/3) ... [2024-11-09 00:19:58,989 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4719b385 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:19:58, skipping insertion in model container [2024-11-09 00:19:58,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:19:58" (3/3) ... [2024-11-09 00:19:58,994 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-91.i [2024-11-09 00:19:59,019 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:19:59,020 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:19:59,087 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:19:59,093 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;@230db1fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:19:59,094 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:19:59,097 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 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-09 00:19:59,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-09 00:19:59,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:19:59,110 INFO L215 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] [2024-11-09 00:19:59,111 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:19:59,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:19:59,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1703649485, now seen corresponding path program 1 times [2024-11-09 00:19:59,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:19:59,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [325234588] [2024-11-09 00:19:59,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:19:59,132 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-09 00:19:59,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:19:59,136 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-09 00:19:59,150 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-09 00:19:59,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:59,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 00:19:59,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:19:59,553 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2024-11-09 00:19:59,556 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:19:59,557 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:19:59,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [325234588] [2024-11-09 00:19:59,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [325234588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:19:59,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:19:59,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:19:59,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489547347] [2024-11-09 00:19:59,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:19:59,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:19:59,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:19:59,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:19:59,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:19:59,612 INFO L87 Difference]: Start difference. First operand has 64 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 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.5) internal successors, (37), 2 states have internal predecessors, (37), 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-09 00:19:59,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:19:59,649 INFO L93 Difference]: Finished difference Result 121 states and 206 transitions. [2024-11-09 00:19:59,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:19:59,652 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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 130 [2024-11-09 00:19:59,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:19:59,658 INFO L225 Difference]: With dead ends: 121 [2024-11-09 00:19:59,658 INFO L226 Difference]: Without dead ends: 60 [2024-11-09 00:19:59,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 129 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-09 00:19:59,665 INFO L432 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-09 00:19:59,667 INFO L433 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-09 00:19:59,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-09 00:19:59,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-09 00:19:59,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 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-09 00:19:59,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 89 transitions. [2024-11-09 00:19:59,717 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 89 transitions. Word has length 130 [2024-11-09 00:19:59,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:19:59,718 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 89 transitions. [2024-11-09 00:19:59,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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-09 00:19:59,719 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 89 transitions. [2024-11-09 00:19:59,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-09 00:19:59,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:19:59,729 INFO L215 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] [2024-11-09 00:19:59,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-09 00:19:59,929 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-09 00:19:59,930 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:19:59,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:19:59,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1779092471, now seen corresponding path program 1 times [2024-11-09 00:19:59,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:19:59,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [345376617] [2024-11-09 00:19:59,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:19:59,934 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-09 00:19:59,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:19:59,936 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-09 00:19:59,938 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-09 00:20:00,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:20:00,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 00:20:00,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:20:00,401 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-09 00:20:00,401 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:20:00,402 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:20:00,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [345376617] [2024-11-09 00:20:00,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [345376617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:20:00,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:20:00,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 00:20:00,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366040289] [2024-11-09 00:20:00,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:20:00,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 00:20:00,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:20:00,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 00:20:00,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 00:20:00,408 INFO L87 Difference]: Start difference. First operand 60 states and 89 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:20:01,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:20:01,403 INFO L93 Difference]: Finished difference Result 176 states and 255 transitions. [2024-11-09 00:20:01,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 00:20:01,407 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 130 [2024-11-09 00:20:01,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:20:01,410 INFO L225 Difference]: With dead ends: 176 [2024-11-09 00:20:01,413 INFO L226 Difference]: Without dead ends: 119 [2024-11-09 00:20:01,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2024-11-09 00:20:01,416 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 104 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 00:20:01,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 282 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 00:20:01,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-09 00:20:01,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 63. [2024-11-09 00:20:01,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 40 states have (on average 1.2) internal successors, (48), 40 states have internal predecessors, (48), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 00:20:01,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 88 transitions. [2024-11-09 00:20:01,446 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 88 transitions. Word has length 130 [2024-11-09 00:20:01,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:20:01,450 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 88 transitions. [2024-11-09 00:20:01,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:20:01,451 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 88 transitions. [2024-11-09 00:20:01,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-09 00:20:01,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:20:01,456 INFO L215 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] [2024-11-09 00:20:01,471 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 (3)] Forceful destruction successful, exit code 0 [2024-11-09 00:20:01,657 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-09 00:20:01,658 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:20:01,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:20:01,662 INFO L85 PathProgramCache]: Analyzing trace with hash -836746247, now seen corresponding path program 1 times [2024-11-09 00:20:01,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:20:01,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [25144216] [2024-11-09 00:20:01,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:20:01,663 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-09 00:20:01,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:20:01,664 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-09 00:20:01,666 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-09 00:20:02,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:20:02,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 00:20:02,084 INFO L278 TraceCheckSpWp]: Computing forward predicates...