./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-48.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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_fillercode_fillercodesize_ps-cn-25_file-48.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 a104afcb2f372aeba0c899855b97d8600d44f06bd857022208f4356fb9ab9902 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 13:20:58,604 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 13:20:58,676 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 13:20:58,681 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 13:20:58,683 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 13:20:58,705 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 13:20:58,705 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 13:20:58,706 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 13:20:58,706 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 13:20:58,707 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 13:20:58,707 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 13:20:58,708 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 13:20:58,708 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 13:20:58,709 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 13:20:58,709 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 13:20:58,709 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 13:20:58,710 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 13:20:58,710 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 13:20:58,713 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 13:20:58,713 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 13:20:58,713 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 13:20:58,714 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 13:20:58,714 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 13:20:58,715 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 13:20:58,715 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 13:20:58,715 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 13:20:58,716 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 13:20:58,716 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 13:20:58,716 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 13:20:58,717 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 13:20:58,717 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 13:20:58,717 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 13:20:58,718 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 13:20:58,718 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 13:20:58,718 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 13:20:58,719 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 13:20:58,719 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 13:20:58,719 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 13:20:58,720 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 13:20:58,720 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 13:20:58,720 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 13:20:58,722 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 13:20:58,723 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 -> a104afcb2f372aeba0c899855b97d8600d44f06bd857022208f4356fb9ab9902 [2024-11-16 13:20:58,982 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 13:20:59,006 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 13:20:59,009 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 13:20:59,010 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 13:20:59,010 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 13:20:59,012 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-48.i [2024-11-16 13:21:00,473 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 13:21:00,663 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 13:21:00,663 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-48.i [2024-11-16 13:21:00,679 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd961295f/ec698f892cae4619a17d389d9d715a01/FLAG5e19c5568 [2024-11-16 13:21:01,041 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd961295f/ec698f892cae4619a17d389d9d715a01 [2024-11-16 13:21:01,044 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 13:21:01,045 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 13:21:01,047 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 13:21:01,048 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 13:21:01,054 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 13:21:01,055 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:21:01" (1/1) ... [2024-11-16 13:21:01,055 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e8d2749 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:21:01, skipping insertion in model container [2024-11-16 13:21:01,055 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:21:01" (1/1) ... [2024-11-16 13:21:01,092 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 13:21:01,277 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_fillercode_fillercodesize_ps-cn-25_file-48.i[915,928] [2024-11-16 13:21:01,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 13:21:01,388 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 13:21:01,405 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_fillercode_fillercodesize_ps-cn-25_file-48.i[915,928] [2024-11-16 13:21:01,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 13:21:01,477 INFO L204 MainTranslator]: Completed translation [2024-11-16 13:21:01,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:21:01 WrapperNode [2024-11-16 13:21:01,478 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 13:21:01,479 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 13:21:01,480 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 13:21:01,480 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 13:21:01,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:21:01" (1/1) ... [2024-11-16 13:21:01,499 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:21:01" (1/1) ... [2024-11-16 13:21:01,543 INFO L138 Inliner]: procedures = 26, calls = 49, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 222 [2024-11-16 13:21:01,543 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 13:21:01,544 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 13:21:01,544 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 13:21:01,544 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 13:21:01,554 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:21:01" (1/1) ... [2024-11-16 13:21:01,554 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:21:01" (1/1) ... [2024-11-16 13:21:01,558 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:21:01" (1/1) ... [2024-11-16 13:21:01,579 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-16 13:21:01,579 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:21:01" (1/1) ... [2024-11-16 13:21:01,580 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:21:01" (1/1) ... [2024-11-16 13:21:01,590 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:21:01" (1/1) ... [2024-11-16 13:21:01,591 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:21:01" (1/1) ... [2024-11-16 13:21:01,594 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:21:01" (1/1) ... [2024-11-16 13:21:01,596 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:21:01" (1/1) ... [2024-11-16 13:21:01,600 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 13:21:01,604 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 13:21:01,604 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 13:21:01,604 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 13:21:01,605 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:21:01" (1/1) ... [2024-11-16 13:21:01,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 13:21:01,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:21:01,643 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-16 13:21:01,652 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-16 13:21:01,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 13:21:01,699 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 13:21:01,700 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 13:21:01,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 13:21:01,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 13:21:01,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 13:21:01,805 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 13:21:01,808 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 13:21:02,216 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-16 13:21:02,216 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 13:21:02,252 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 13:21:02,253 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 13:21:02,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:21:02 BoogieIcfgContainer [2024-11-16 13:21:02,253 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 13:21:02,259 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 13:21:02,259 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 13:21:02,262 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 13:21:02,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 01:21:01" (1/3) ... [2024-11-16 13:21:02,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cdd4717 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:21:02, skipping insertion in model container [2024-11-16 13:21:02,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:21:01" (2/3) ... [2024-11-16 13:21:02,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cdd4717 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:21:02, skipping insertion in model container [2024-11-16 13:21:02,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:21:02" (3/3) ... [2024-11-16 13:21:02,266 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-48.i [2024-11-16 13:21:02,285 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 13:21:02,286 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 13:21:02,350 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 13:21:02,361 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;@33e87ab3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 13:21:02,362 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 13:21:02,366 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 62 states have (on average 1.3870967741935485) internal successors, (86), 63 states have internal predecessors, (86), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 13:21:02,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-16 13:21:02,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:21:02,384 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:21:02,385 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:21:02,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:21:02,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1239364650, now seen corresponding path program 1 times [2024-11-16 13:21:02,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:21:02,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411583342] [2024-11-16 13:21:02,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:21:02,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:21:02,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:02,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:21:02,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:02,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:21:02,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:02,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:21:02,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:02,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 13:21:02,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:02,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 13:21:02,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:02,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-16 13:21:02,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:02,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-16 13:21:02,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:02,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 13:21:02,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:02,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-16 13:21:02,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:02,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 13:21:02,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:02,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 13:21:02,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:02,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 13:21:02,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:02,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 13:21:02,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:02,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 13:21:02,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:02,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 13:21:02,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:02,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 13:21:02,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:02,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 13:21:02,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:02,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 13:21:02,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:02,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 13:21:02,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:02,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 13:21:02,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:02,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 13:21:02,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:02,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 13:21:02,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:02,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 13:21:02,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:02,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 13:21:02,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:02,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 13:21:02,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:02,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 13:21:02,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:02,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 13:21:02,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:02,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 13:21:02,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:02,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 13:21:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:02,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-16 13:21:02,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:02,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-16 13:21:02,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:02,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-16 13:21:02,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:02,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-16 13:21:02,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:02,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-16 13:21:02,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:02,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-16 13:21:02,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:02,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-16 13:21:02,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:02,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-16 13:21:02,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:21:02,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411583342] [2024-11-16 13:21:02,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411583342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:21:02,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:21:02,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 13:21:02,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202567649] [2024-11-16 13:21:02,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:21:02,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 13:21:02,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:21:03,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 13:21:03,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 13:21:03,016 INFO L87 Difference]: Start difference. First operand has 101 states, 62 states have (on average 1.3870967741935485) internal successors, (86), 63 states have internal predecessors, (86), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-16 13:21:03,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:21:03,055 INFO L93 Difference]: Finished difference Result 193 states and 343 transitions. [2024-11-16 13:21:03,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 13:21:03,057 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) Word has length 225 [2024-11-16 13:21:03,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:21:03,087 INFO L225 Difference]: With dead ends: 193 [2024-11-16 13:21:03,087 INFO L226 Difference]: Without dead ends: 95 [2024-11-16 13:21:03,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 110 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-16 13:21:03,102 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 13:21:03,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 13:21:03,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-16 13:21:03,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-16 13:21:03,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 57 states have internal predecessors, (74), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 13:21:03,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 146 transitions. [2024-11-16 13:21:03,184 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 146 transitions. Word has length 225 [2024-11-16 13:21:03,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:21:03,185 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 146 transitions. [2024-11-16 13:21:03,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-16 13:21:03,186 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 146 transitions. [2024-11-16 13:21:03,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-16 13:21:03,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:21:03,191 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:21:03,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 13:21:03,192 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:21:03,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:21:03,196 INFO L85 PathProgramCache]: Analyzing trace with hash 2088183250, now seen corresponding path program 1 times [2024-11-16 13:21:03,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:21:03,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285085102] [2024-11-16 13:21:03,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:21:03,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:21:03,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:21:03,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:21:03,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:21:03,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 13:21:03,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 13:21:03,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-16 13:21:03,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-16 13:21:03,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 13:21:03,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-16 13:21:03,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 13:21:03,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 13:21:03,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 13:21:03,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 13:21:03,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 13:21:03,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 13:21:03,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 13:21:03,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 13:21:03,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 13:21:03,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 13:21:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 13:21:03,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 13:21:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 13:21:03,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 13:21:03,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 13:21:03,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 13:21:03,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 13:21:03,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 13:21:03,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 13:21:03,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 13:21:03,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-16 13:21:03,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-16 13:21:03,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-16 13:21:03,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-16 13:21:03,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-16 13:21:03,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-16 13:21:03,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-16 13:21:03,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-16 13:21:03,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:21:03,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285085102] [2024-11-16 13:21:03,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285085102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:21:03,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:21:03,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 13:21:03,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773972235] [2024-11-16 13:21:03,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:21:03,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 13:21:03,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:21:03,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 13:21:03,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 13:21:03,579 INFO L87 Difference]: Start difference. First operand 95 states and 146 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-16 13:21:03,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:21:03,652 INFO L93 Difference]: Finished difference Result 207 states and 317 transitions. [2024-11-16 13:21:03,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 13:21:03,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 225 [2024-11-16 13:21:03,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:21:03,656 INFO L225 Difference]: With dead ends: 207 [2024-11-16 13:21:03,656 INFO L226 Difference]: Without dead ends: 115 [2024-11-16 13:21:03,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 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-16 13:21:03,662 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 20 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 13:21:03,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 280 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 13:21:03,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-16 13:21:03,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 102. [2024-11-16 13:21:03,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 64 states have (on average 1.3125) internal successors, (84), 64 states have internal predecessors, (84), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 13:21:03,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 156 transitions. [2024-11-16 13:21:03,688 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 156 transitions. Word has length 225 [2024-11-16 13:21:03,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:21:03,691 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 156 transitions. [2024-11-16 13:21:03,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-16 13:21:03,692 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 156 transitions. [2024-11-16 13:21:03,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-16 13:21:03,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:21:03,698 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:21:03,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 13:21:03,699 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:21:03,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:21:03,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1319280365, now seen corresponding path program 1 times [2024-11-16 13:21:03,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:21:03,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689938410] [2024-11-16 13:21:03,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:21:03,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:21:03,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:21:03,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:21:03,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:21:03,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 13:21:03,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 13:21:03,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-16 13:21:03,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-16 13:21:03,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 13:21:03,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-16 13:21:03,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 13:21:03,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 13:21:03,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 13:21:03,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 13:21:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 13:21:03,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 13:21:03,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 13:21:03,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 13:21:03,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:03,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 13:21:04,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 13:21:04,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 13:21:04,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 13:21:04,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 13:21:04,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 13:21:04,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 13:21:04,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 13:21:04,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 13:21:04,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 13:21:04,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 13:21:04,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 13:21:04,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-16 13:21:04,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-16 13:21:04,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-16 13:21:04,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-16 13:21:04,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-16 13:21:04,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-16 13:21:04,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-16 13:21:04,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-16 13:21:04,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:21:04,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689938410] [2024-11-16 13:21:04,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689938410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:21:04,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:21:04,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 13:21:04,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644320135] [2024-11-16 13:21:04,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:21:04,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 13:21:04,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:21:04,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 13:21:04,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 13:21:04,137 INFO L87 Difference]: Start difference. First operand 102 states and 156 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-16 13:21:04,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:21:04,181 INFO L93 Difference]: Finished difference Result 300 states and 462 transitions. [2024-11-16 13:21:04,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 13:21:04,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 225 [2024-11-16 13:21:04,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:21:04,186 INFO L225 Difference]: With dead ends: 300 [2024-11-16 13:21:04,186 INFO L226 Difference]: Without dead ends: 201 [2024-11-16 13:21:04,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 73 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-16 13:21:04,188 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 68 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 13:21:04,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 278 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 13:21:04,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-16 13:21:04,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 198. [2024-11-16 13:21:04,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 123 states have (on average 1.3089430894308942) internal successors, (161), 123 states have internal predecessors, (161), 72 states have call successors, (72), 2 states have call predecessors, (72), 2 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-16 13:21:04,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 305 transitions. [2024-11-16 13:21:04,231 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 305 transitions. Word has length 225 [2024-11-16 13:21:04,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:21:04,231 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 305 transitions. [2024-11-16 13:21:04,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-16 13:21:04,232 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 305 transitions. [2024-11-16 13:21:04,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-16 13:21:04,236 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:21:04,237 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:21:04,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 13:21:04,238 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:21:04,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:21:04,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1984010315, now seen corresponding path program 1 times [2024-11-16 13:21:04,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:21:04,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626587464] [2024-11-16 13:21:04,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:21:04,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:21:04,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:21:04,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:21:04,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:21:04,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 13:21:04,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 13:21:04,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-16 13:21:04,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-16 13:21:04,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 13:21:04,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-16 13:21:04,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 13:21:04,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 13:21:04,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 13:21:04,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 13:21:04,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 13:21:04,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 13:21:04,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 13:21:04,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 13:21:04,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 13:21:04,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 13:21:04,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 13:21:04,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 13:21:04,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 13:21:04,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 13:21:04,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 13:21:04,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 13:21:04,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 13:21:04,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 13:21:04,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 13:21:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 13:21:04,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-16 13:21:04,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-16 13:21:04,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-16 13:21:04,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-16 13:21:04,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-16 13:21:04,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-16 13:21:04,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-16 13:21:04,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:04,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-16 13:21:04,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:21:04,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626587464] [2024-11-16 13:21:04,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626587464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:21:04,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:21:04,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 13:21:04,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752702476] [2024-11-16 13:21:04,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:21:04,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 13:21:04,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:21:04,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 13:21:04,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-16 13:21:04,926 INFO L87 Difference]: Start difference. First operand 198 states and 305 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-16 13:21:05,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:21:05,648 INFO L93 Difference]: Finished difference Result 864 states and 1323 transitions. [2024-11-16 13:21:05,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 13:21:05,649 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 226 [2024-11-16 13:21:05,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:21:05,657 INFO L225 Difference]: With dead ends: 864 [2024-11-16 13:21:05,658 INFO L226 Difference]: Without dead ends: 669 [2024-11-16 13:21:05,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-16 13:21:05,661 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 286 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 13:21:05,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 569 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 13:21:05,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2024-11-16 13:21:05,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 532. [2024-11-16 13:21:05,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 341 states have (on average 1.3284457478005864) internal successors, (453), 343 states have internal predecessors, (453), 184 states have call successors, (184), 6 states have call predecessors, (184), 6 states have return successors, (184), 182 states have call predecessors, (184), 184 states have call successors, (184) [2024-11-16 13:21:05,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 821 transitions. [2024-11-16 13:21:05,791 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 821 transitions. Word has length 226 [2024-11-16 13:21:05,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:21:05,792 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 821 transitions. [2024-11-16 13:21:05,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-16 13:21:05,793 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 821 transitions. [2024-11-16 13:21:05,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-16 13:21:05,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:21:05,796 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:21:05,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 13:21:05,796 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:21:05,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:21:05,796 INFO L85 PathProgramCache]: Analyzing trace with hash -476458506, now seen corresponding path program 1 times [2024-11-16 13:21:05,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:21:05,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412647573] [2024-11-16 13:21:05,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:21:05,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:21:05,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:05,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:21:05,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:05,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:21:05,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:05,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:21:05,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:05,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 13:21:05,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:05,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 13:21:05,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:05,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-16 13:21:05,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:05,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-16 13:21:05,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:05,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 13:21:05,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:05,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-16 13:21:05,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:05,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 13:21:05,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:05,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 13:21:05,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:05,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 13:21:05,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:05,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 13:21:05,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:06,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 13:21:06,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:06,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 13:21:06,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:06,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 13:21:06,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:06,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 13:21:06,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:06,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 13:21:06,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:06,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 13:21:06,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:06,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 13:21:06,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:06,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 13:21:06,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:06,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 13:21:06,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:06,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 13:21:06,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:06,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 13:21:06,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:06,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 13:21:06,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:06,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 13:21:06,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:06,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 13:21:06,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:06,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 13:21:06,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:06,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 13:21:06,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:06,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-16 13:21:06,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:06,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-16 13:21:06,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:06,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-16 13:21:06,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:06,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-16 13:21:06,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:06,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-16 13:21:06,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:06,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-16 13:21:06,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:06,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-16 13:21:06,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:06,058 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-16 13:21:06,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:21:06,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412647573] [2024-11-16 13:21:06,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412647573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:21:06,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:21:06,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 13:21:06,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915700197] [2024-11-16 13:21:06,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:21:06,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 13:21:06,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:21:06,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 13:21:06,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 13:21:06,062 INFO L87 Difference]: Start difference. First operand 532 states and 821 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-16 13:21:06,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:21:06,154 INFO L93 Difference]: Finished difference Result 1096 states and 1682 transitions. [2024-11-16 13:21:06,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 13:21:06,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 226 [2024-11-16 13:21:06,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:21:06,160 INFO L225 Difference]: With dead ends: 1096 [2024-11-16 13:21:06,160 INFO L226 Difference]: Without dead ends: 567 [2024-11-16 13:21:06,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 76 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-16 13:21:06,163 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 101 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 13:21:06,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 290 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 13:21:06,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2024-11-16 13:21:06,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 339. [2024-11-16 13:21:06,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 204 states have (on average 1.2549019607843137) internal successors, (256), 205 states have internal predecessors, (256), 128 states have call successors, (128), 6 states have call predecessors, (128), 6 states have return successors, (128), 127 states have call predecessors, (128), 128 states have call successors, (128) [2024-11-16 13:21:06,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 512 transitions. [2024-11-16 13:21:06,214 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 512 transitions. Word has length 226 [2024-11-16 13:21:06,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:21:06,216 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 512 transitions. [2024-11-16 13:21:06,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-16 13:21:06,217 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 512 transitions. [2024-11-16 13:21:06,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-16 13:21:06,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:21:06,219 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:21:06,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 13:21:06,220 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:21:06,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:21:06,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1902132756, now seen corresponding path program 1 times [2024-11-16 13:21:06,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:21:06,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714231332] [2024-11-16 13:21:06,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:21:06,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:21:06,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 13:21:06,343 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 13:21:06,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 13:21:06,515 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 13:21:06,515 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 13:21:06,516 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 13:21:06,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 13:21:06,521 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-16 13:21:06,660 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 13:21:06,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 01:21:06 BoogieIcfgContainer [2024-11-16 13:21:06,665 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 13:21:06,665 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 13:21:06,665 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 13:21:06,665 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 13:21:06,666 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:21:02" (3/4) ... [2024-11-16 13:21:06,670 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 13:21:06,671 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 13:21:06,671 INFO L158 Benchmark]: Toolchain (without parser) took 5626.37ms. Allocated memory was 163.6MB in the beginning and 247.5MB in the end (delta: 83.9MB). Free memory was 90.8MB in the beginning and 99.8MB in the end (delta: -9.0MB). Peak memory consumption was 77.2MB. Max. memory is 16.1GB. [2024-11-16 13:21:06,672 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 163.6MB. Free memory was 114.0MB in the beginning and 113.8MB in the end (delta: 295.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 13:21:06,672 INFO L158 Benchmark]: CACSL2BoogieTranslator took 431.84ms. Allocated memory is still 163.6MB. Free memory was 90.4MB in the beginning and 73.3MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 13:21:06,672 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.08ms. Allocated memory is still 163.6MB. Free memory was 73.3MB in the beginning and 69.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 13:21:06,672 INFO L158 Benchmark]: Boogie Preprocessor took 56.26ms. Allocated memory is still 163.6MB. Free memory was 68.7MB in the beginning and 63.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 13:21:06,673 INFO L158 Benchmark]: IcfgBuilder took 649.21ms. Allocated memory was 163.6MB in the beginning and 205.5MB in the end (delta: 41.9MB). Free memory was 63.5MB in the beginning and 154.0MB in the end (delta: -90.5MB). Peak memory consumption was 23.0MB. Max. memory is 16.1GB. [2024-11-16 13:21:06,673 INFO L158 Benchmark]: TraceAbstraction took 4406.32ms. Allocated memory was 205.5MB in the beginning and 247.5MB in the end (delta: 41.9MB). Free memory was 154.0MB in the beginning and 99.8MB in the end (delta: 54.2MB). Peak memory consumption was 96.1MB. Max. memory is 16.1GB. [2024-11-16 13:21:06,673 INFO L158 Benchmark]: Witness Printer took 5.58ms. Allocated memory is still 247.5MB. Free memory is still 99.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 13:21:06,674 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.22ms. Allocated memory is still 163.6MB. Free memory was 114.0MB in the beginning and 113.8MB in the end (delta: 295.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 431.84ms. Allocated memory is still 163.6MB. Free memory was 90.4MB in the beginning and 73.3MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.08ms. Allocated memory is still 163.6MB. Free memory was 73.3MB in the beginning and 69.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.26ms. Allocated memory is still 163.6MB. Free memory was 68.7MB in the beginning and 63.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 649.21ms. Allocated memory was 163.6MB in the beginning and 205.5MB in the end (delta: 41.9MB). Free memory was 63.5MB in the beginning and 154.0MB in the end (delta: -90.5MB). Peak memory consumption was 23.0MB. Max. memory is 16.1GB. * TraceAbstraction took 4406.32ms. Allocated memory was 205.5MB in the beginning and 247.5MB in the end (delta: 41.9MB). Free memory was 154.0MB in the beginning and 99.8MB in the end (delta: 54.2MB). Peak memory consumption was 96.1MB. Max. memory is 16.1GB. * Witness Printer took 5.58ms. Allocated memory is still 247.5MB. Free memory is still 99.8MB. 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 someBinaryDOUBLEComparisonOperation at line 195. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 10; [L23] unsigned char var_1_2 = 1; [L24] double var_1_3 = 0.0; [L25] double var_1_4 = 128.2; [L26] double var_1_5 = 50.1; [L27] double var_1_6 = 64.5; [L28] unsigned short int var_1_7 = 1; [L29] unsigned char var_1_8 = 5; [L30] double var_1_9 = 15.35; [L31] unsigned char var_1_10 = 10; [L32] unsigned char var_1_11 = 2; [L33] signed long int var_1_12 = 32; [L34] signed long int var_1_13 = 256; [L35] signed char var_1_14 = 1; [L36] unsigned char var_1_15 = 128; [L37] unsigned char var_1_16 = 0; [L38] signed char var_1_17 = -64; [L39] unsigned short int var_1_18 = 64; [L40] unsigned short int var_1_20 = 8; [L41] unsigned short int var_1_21 = 10; [L42] signed long int var_1_22 = -256; [L43] signed long int var_1_23 = -128; [L44] signed short int var_1_24 = 4; [L45] signed short int var_1_25 = 64; [L46] unsigned long int var_1_26 = 16; [L47] unsigned char var_1_27 = 8; [L48] unsigned char var_1_28 = 0; [L49] unsigned char var_1_29 = 0; [L50] unsigned char var_1_30 = 0; [L51] signed char var_1_31 = -4; [L52] signed char var_1_32 = 2; [L53] signed char var_1_33 = 32; [L54] unsigned char last_1_var_1_8 = 5; [L55] unsigned short int last_1_var_1_18 = 64; VAL [isInitial=0, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=1, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L199] isInitial = 1 [L200] FCALL initially() [L201] COND TRUE 1 [L202] CALL updateLastVariables() [L191] last_1_var_1_8 = var_1_8 [L192] last_1_var_1_18 = var_1_18 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=1, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L202] RET updateLastVariables() [L203] CALL updateVariables() [L133] var_1_2 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L134] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L135] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L135] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L136] var_1_3 = __VERIFIER_nondet_double() [L137] CALL assume_abort_if_not((var_1_3 >= 4611686.018427387900e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L137] RET assume_abort_if_not((var_1_3 >= 4611686.018427387900e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L138] var_1_4 = __VERIFIER_nondet_double() [L139] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427387900e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L139] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427387900e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L140] var_1_5 = __VERIFIER_nondet_double() [L141] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L141] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L142] var_1_6 = __VERIFIER_nondet_double() [L143] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=1, var_1_8=5, var_1_9=307/20] [L143] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=1, var_1_8=5, var_1_9=307/20] [L144] var_1_7 = __VERIFIER_nondet_ushort() [L145] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_8=5, var_1_9=307/20] [L145] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_8=5, var_1_9=307/20] [L146] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5, var_1_9=307/20] [L146] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5, var_1_9=307/20] [L147] var_1_9 = __VERIFIER_nondet_double() [L148] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L148] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L149] CALL assume_abort_if_not(var_1_9 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L149] RET assume_abort_if_not(var_1_9 != 0.0F) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L150] var_1_10 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L151] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L152] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L152] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L153] var_1_11 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L154] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L155] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L155] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L156] var_1_15 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_15 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L157] RET assume_abort_if_not(var_1_15 >= 127) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L158] CALL assume_abort_if_not(var_1_15 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L158] RET assume_abort_if_not(var_1_15 <= 255) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L159] var_1_16 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L160] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L161] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L161] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L162] var_1_17 = __VERIFIER_nondet_char() [L163] CALL assume_abort_if_not(var_1_17 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L163] RET assume_abort_if_not(var_1_17 >= -126) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L164] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L164] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L165] var_1_21 = __VERIFIER_nondet_ushort() [L166] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L166] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L167] CALL assume_abort_if_not(var_1_21 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=1, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=1, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L167] RET assume_abort_if_not(var_1_21 <= 65534) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=1, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L168] var_1_23 = __VERIFIER_nondet_long() [L169] CALL assume_abort_if_not(var_1_23 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L169] RET assume_abort_if_not(var_1_23 >= -2147483647) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L170] CALL assume_abort_if_not(var_1_23 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L170] RET assume_abort_if_not(var_1_23 <= 2147483646) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L171] var_1_25 = __VERIFIER_nondet_short() [L172] CALL assume_abort_if_not(var_1_25 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=1, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=1, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L172] RET assume_abort_if_not(var_1_25 >= -32767) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=1, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L173] CALL assume_abort_if_not(var_1_25 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=1, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=1, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L173] RET assume_abort_if_not(var_1_25 <= 32766) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=1, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L174] var_1_28 = __VERIFIER_nondet_uchar() [L175] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=1, var_1_26=16, var_1_27=8, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=1, var_1_26=16, var_1_27=8, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L175] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=1, var_1_26=16, var_1_27=8, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L176] CALL assume_abort_if_not(var_1_28 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=1, var_1_26=16, var_1_27=8, var_1_28=1, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=1, var_1_26=16, var_1_27=8, var_1_28=1, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L176] RET assume_abort_if_not(var_1_28 <= 1) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=1, var_1_26=16, var_1_27=8, var_1_28=1, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L177] var_1_29 = __VERIFIER_nondet_uchar() [L178] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=1, var_1_26=16, var_1_27=8, var_1_28=1, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=1, var_1_26=16, var_1_27=8, var_1_28=1, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L178] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=1, var_1_26=16, var_1_27=8, var_1_28=1, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L179] CALL assume_abort_if_not(var_1_29 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=1, var_1_26=16, var_1_27=8, var_1_28=1, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=1, var_1_26=16, var_1_27=8, var_1_28=1, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L179] RET assume_abort_if_not(var_1_29 <= 1) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=1, var_1_26=16, var_1_27=8, var_1_28=1, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L180] var_1_30 = __VERIFIER_nondet_uchar() [L181] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=1, var_1_26=16, var_1_27=8, var_1_28=1, var_1_29=1, var_1_2=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=1, var_1_26=16, var_1_27=8, var_1_28=1, var_1_29=1, var_1_2=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L181] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=1, var_1_26=16, var_1_27=8, var_1_28=1, var_1_29=1, var_1_2=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L182] CALL assume_abort_if_not(var_1_30 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=1, var_1_26=16, var_1_27=8, var_1_28=1, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=1, var_1_26=16, var_1_27=8, var_1_28=1, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L182] RET assume_abort_if_not(var_1_30 <= 254) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=1, var_1_26=16, var_1_27=8, var_1_28=1, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L183] var_1_32 = __VERIFIER_nondet_char() [L184] CALL assume_abort_if_not(var_1_32 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=1, var_1_26=16, var_1_27=8, var_1_28=1, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=126, var_1_33=32, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=1, var_1_26=16, var_1_27=8, var_1_28=1, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=126, var_1_33=32, var_1_7=0, var_1_8=5] [L184] RET assume_abort_if_not(var_1_32 >= -1) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=1, var_1_26=16, var_1_27=8, var_1_28=1, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=126, var_1_33=32, var_1_7=0, var_1_8=5] [L185] CALL assume_abort_if_not(var_1_32 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=1, var_1_26=16, var_1_27=8, var_1_28=1, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=126, var_1_33=32, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=1, var_1_26=16, var_1_27=8, var_1_28=1, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=126, var_1_33=32, var_1_7=0, var_1_8=5] [L185] RET assume_abort_if_not(var_1_32 <= 126) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=1, var_1_26=16, var_1_27=8, var_1_28=1, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=126, var_1_33=32, var_1_7=0, var_1_8=5] [L186] var_1_33 = __VERIFIER_nondet_char() [L187] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=1, var_1_26=16, var_1_27=8, var_1_28=1, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=126, var_1_33=122, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=1, var_1_26=16, var_1_27=8, var_1_28=1, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=126, var_1_33=122, var_1_7=0, var_1_8=5] [L187] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=1, var_1_26=16, var_1_27=8, var_1_28=1, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=126, var_1_33=122, var_1_7=0, var_1_8=5] [L188] CALL assume_abort_if_not(var_1_33 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=1, var_1_26=16, var_1_27=8, var_1_28=1, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=126, var_1_33=122, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=1, var_1_26=16, var_1_27=8, var_1_28=1, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=126, var_1_33=122, var_1_7=0, var_1_8=5] [L188] RET assume_abort_if_not(var_1_33 <= 126) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=1, var_1_26=16, var_1_27=8, var_1_28=1, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=126, var_1_33=122, var_1_7=0, var_1_8=5] [L203] RET updateVariables() [L204] CALL step() [L59] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=1, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=1, var_1_26=16, var_1_27=8, var_1_28=1, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=126, var_1_33=122, var_1_7=0, var_1_8=5] [L60] COND FALSE !(var_1_20 < var_1_21) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=1, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=1, var_1_26=16, var_1_27=8, var_1_28=1, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=126, var_1_33=122, var_1_7=0, var_1_8=5] [L63] COND TRUE (~ var_1_20) != ((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23))) [L64] var_1_24 = var_1_25 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=1, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=16, var_1_27=8, var_1_28=1, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=126, var_1_33=122, var_1_7=0, var_1_8=5] [L66] var_1_26 = var_1_20 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=1, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=8, var_1_28=1, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=126, var_1_33=122, var_1_7=0, var_1_8=5] [L67] EXPR var_1_25 | ((((-16) > (var_1_20)) ? (-16) : (var_1_20))) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=1, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=8, var_1_28=1, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=126, var_1_33=122, var_1_7=0, var_1_8=5] [L67] COND FALSE !(var_1_23 > (var_1_25 | ((((-16) > (var_1_20)) ? (-16) : (var_1_20))))) [L74] COND TRUE var_1_27 >= var_1_21 [L75] var_1_31 = (var_1_32 - var_1_33) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=1, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=8, var_1_28=1, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=122, var_1_7=0, var_1_8=5] [L79] COND FALSE !(\read(var_1_2)) [L86] var_1_1 = 1 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=1, var_1_20=1, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=8, var_1_28=1, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=122, var_1_7=0, var_1_8=5] [L88] unsigned short int stepLocal_0 = var_1_1; VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=1, var_1_20=1, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=8, var_1_28=1, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=122, var_1_7=0, var_1_8=5] [L89] COND TRUE var_1_6 > (var_1_5 / ((((var_1_3) > (var_1_9)) ? (var_1_3) : (var_1_9)))) [L90] var_1_8 = ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=1, var_1_20=1, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=8, var_1_28=1, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=122, var_1_7=0, var_1_8=64] [L98] COND FALSE !(\read(var_1_2)) [L107] var_1_12 = last_1_var_1_18 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=64, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=1, var_1_20=1, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=8, var_1_28=1, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=122, var_1_7=0, var_1_8=64] [L109] signed long int stepLocal_1 = ((((var_1_15 - var_1_16)) > (var_1_12)) ? ((var_1_15 - var_1_16)) : (var_1_12)); VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, stepLocal_1=64, var_1_10=64, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=1, var_1_20=1, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=8, var_1_28=1, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=122, var_1_7=0, var_1_8=64] [L110] COND TRUE var_1_10 == stepLocal_1 [L111] var_1_14 = ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=64, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=126, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=1, var_1_20=1, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=8, var_1_28=1, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=122, var_1_7=0, var_1_8=64] [L115] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=64, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=126, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=1, var_1_20=1, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=8, var_1_28=1, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=122, var_1_7=0, var_1_8=64] [L118] COND FALSE !(var_1_8 == var_1_13) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=64, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=126, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=1, var_1_20=1, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=8, var_1_28=1, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=122, var_1_7=0, var_1_8=64] [L121] COND FALSE !(last_1_var_1_18 != var_1_16) [L128] var_1_18 = var_1_10 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=64, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=126, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=1, var_1_20=1, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=8, var_1_28=1, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=122, var_1_7=0, var_1_8=64] [L204] RET step() [L205] CALL, EXPR property() [L195-L196] return (((((var_1_2 ? ((((var_1_3 - var_1_4) - var_1_5) == (15.75 - var_1_6)) ? (var_1_1 == ((unsigned short int) (5 + last_1_var_1_8))) : (var_1_1 == ((unsigned short int) last_1_var_1_8))) : (var_1_1 == ((unsigned short int) 1))) && ((var_1_6 > (var_1_5 / ((((var_1_3) > (var_1_9)) ? (var_1_3) : (var_1_9))))) ? (var_1_8 == ((unsigned char) ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))))) : ((var_1_1 <= var_1_7) ? (var_1_8 == ((unsigned char) var_1_10)) : (var_1_8 == ((unsigned char) var_1_11))))) && (var_1_2 ? ((-128 > var_1_10) ? ((var_1_3 >= (2.75 / var_1_9)) ? (var_1_12 == ((signed long int) (var_1_11 + (last_1_var_1_18 + var_1_10)))) : (var_1_12 == ((signed long int) last_1_var_1_18))) : 1) : (var_1_12 == ((signed long int) last_1_var_1_18)))) && (var_1_2 ? (var_1_13 == ((signed long int) var_1_11)) : 1)) && ((var_1_10 == (((((var_1_15 - var_1_16)) > (var_1_12)) ? ((var_1_15 - var_1_16)) : (var_1_12)))) ? (var_1_14 == ((signed char) ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))))) : (var_1_14 == ((signed char) var_1_17)))) && ((var_1_8 == var_1_13) ? (var_1_18 == ((unsigned short int) (var_1_10 + ((((var_1_14) < (var_1_16)) ? (var_1_14) : (var_1_16)))))) : ((last_1_var_1_18 != var_1_16) ? ((-256 >= var_1_13) ? (var_1_18 == ((unsigned short int) var_1_16)) : (var_1_18 == ((unsigned short int) var_1_15))) : (var_1_18 == ((unsigned short int) var_1_10)))) ; VAL [\result=0, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=126, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=1, var_1_20=1, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=8, var_1_28=1, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=122, var_1_7=0, var_1_8=64] [L205] RET, EXPR property() [L205] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=126, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=1, var_1_20=1, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=8, var_1_28=1, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=122, var_1_7=0, var_1_8=64] [L19] reach_error() VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=126, var_1_15=127, var_1_16=64, var_1_17=126, var_1_18=64, var_1_1=1, var_1_20=1, var_1_21=1, var_1_22=-256, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=8, var_1_28=1, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=4, var_1_32=126, var_1_33=122, var_1_7=0, var_1_8=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.2s, OverallIterations: 6, TraceHistogramMax: 36, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 475 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 475 mSDsluCounter, 1562 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 744 mSDsCounter, 129 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 401 IncrementalHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 129 mSolverCounterUnsat, 818 mSDtfsCounter, 401 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 417 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=532occurred in iteration=4, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 5 MinimizatonAttempts, 381 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1353 NumberOfCodeBlocks, 1353 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 1122 ConstructedInterpolants, 0 QuantifiedInterpolants, 1915 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 12600/12600 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-16 13:21:06,715 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_fillercode_fillercodesize_ps-cn-25_file-48.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 a104afcb2f372aeba0c899855b97d8600d44f06bd857022208f4356fb9ab9902 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 13:21:08,906 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 13:21:08,991 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 13:21:08,997 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 13:21:08,998 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 13:21:09,032 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 13:21:09,034 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 13:21:09,035 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 13:21:09,035 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 13:21:09,037 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 13:21:09,037 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 13:21:09,038 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 13:21:09,039 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 13:21:09,040 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 13:21:09,041 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 13:21:09,041 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 13:21:09,042 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 13:21:09,042 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 13:21:09,042 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 13:21:09,043 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 13:21:09,043 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 13:21:09,046 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 13:21:09,047 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 13:21:09,047 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 13:21:09,047 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 13:21:09,048 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 13:21:09,048 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 13:21:09,048 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 13:21:09,048 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 13:21:09,049 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 13:21:09,049 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 13:21:09,049 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 13:21:09,049 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 13:21:09,050 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 13:21:09,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 13:21:09,050 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 13:21:09,051 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 13:21:09,051 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 13:21:09,051 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 13:21:09,051 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 13:21:09,052 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 13:21:09,053 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 13:21:09,053 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 13:21:09,053 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 13:21:09,054 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 -> a104afcb2f372aeba0c899855b97d8600d44f06bd857022208f4356fb9ab9902 [2024-11-16 13:21:09,396 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 13:21:09,417 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 13:21:09,421 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 13:21:09,422 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 13:21:09,423 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 13:21:09,424 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-48.i [2024-11-16 13:21:11,030 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 13:21:11,262 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 13:21:11,264 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-48.i [2024-11-16 13:21:11,281 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/489c57e48/54ef096dca884ea693349f691e30ac60/FLAGf14464b01 [2024-11-16 13:21:11,614 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/489c57e48/54ef096dca884ea693349f691e30ac60 [2024-11-16 13:21:11,617 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 13:21:11,618 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 13:21:11,622 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 13:21:11,623 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 13:21:11,628 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 13:21:11,629 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:21:11" (1/1) ... [2024-11-16 13:21:11,630 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f7e64b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:21:11, skipping insertion in model container [2024-11-16 13:21:11,630 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:21:11" (1/1) ... [2024-11-16 13:21:11,662 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 13:21:11,846 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_fillercode_fillercodesize_ps-cn-25_file-48.i[915,928] [2024-11-16 13:21:11,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 13:21:11,970 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 13:21:11,982 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_fillercode_fillercodesize_ps-cn-25_file-48.i[915,928] [2024-11-16 13:21:12,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 13:21:12,047 INFO L204 MainTranslator]: Completed translation [2024-11-16 13:21:12,047 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:21:12 WrapperNode [2024-11-16 13:21:12,047 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 13:21:12,048 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 13:21:12,048 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 13:21:12,049 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 13:21:12,055 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:21:12" (1/1) ... [2024-11-16 13:21:12,072 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:21:12" (1/1) ... [2024-11-16 13:21:12,110 INFO L138 Inliner]: procedures = 27, calls = 49, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 208 [2024-11-16 13:21:12,111 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 13:21:12,111 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 13:21:12,111 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 13:21:12,111 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 13:21:12,127 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:21:12" (1/1) ... [2024-11-16 13:21:12,127 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:21:12" (1/1) ... [2024-11-16 13:21:12,133 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:21:12" (1/1) ... [2024-11-16 13:21:12,156 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-16 13:21:12,156 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:21:12" (1/1) ... [2024-11-16 13:21:12,157 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:21:12" (1/1) ... [2024-11-16 13:21:12,172 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:21:12" (1/1) ... [2024-11-16 13:21:12,172 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:21:12" (1/1) ... [2024-11-16 13:21:12,174 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:21:12" (1/1) ... [2024-11-16 13:21:12,178 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:21:12" (1/1) ... [2024-11-16 13:21:12,181 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 13:21:12,184 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 13:21:12,184 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 13:21:12,184 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 13:21:12,185 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:21:12" (1/1) ... [2024-11-16 13:21:12,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 13:21:12,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:21:12,218 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-16 13:21:12,224 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-16 13:21:12,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 13:21:12,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 13:21:12,266 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 13:21:12,266 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 13:21:12,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 13:21:12,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 13:21:12,350 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 13:21:12,352 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 13:21:39,166 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-16 13:21:39,166 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 13:21:39,187 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 13:21:39,187 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 13:21:39,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:21:39 BoogieIcfgContainer [2024-11-16 13:21:39,188 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 13:21:39,190 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 13:21:39,190 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 13:21:39,193 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 13:21:39,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 01:21:11" (1/3) ... [2024-11-16 13:21:39,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@670c9dc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:21:39, skipping insertion in model container [2024-11-16 13:21:39,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:21:12" (2/3) ... [2024-11-16 13:21:39,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@670c9dc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:21:39, skipping insertion in model container [2024-11-16 13:21:39,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:21:39" (3/3) ... [2024-11-16 13:21:39,198 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-48.i [2024-11-16 13:21:39,216 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 13:21:39,216 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 13:21:39,284 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 13:21:39,290 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;@1f1cbfb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 13:21:39,290 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 13:21:39,295 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 60 states have internal predecessors, (81), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 13:21:39,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-16 13:21:39,312 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:21:39,313 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:21:39,314 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:21:39,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:21:39,319 INFO L85 PathProgramCache]: Analyzing trace with hash -851476613, now seen corresponding path program 1 times [2024-11-16 13:21:39,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:21:39,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1250934355] [2024-11-16 13:21:39,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:21:39,336 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-16 13:21:39,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:21:39,339 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-16 13:21:39,341 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-16 13:21:40,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:40,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 13:21:40,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:21:40,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 1070 proven. 0 refuted. 0 times theorem prover too weak. 1450 trivial. 0 not checked. [2024-11-16 13:21:40,866 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 13:21:40,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 13:21:40,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1250934355] [2024-11-16 13:21:40,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1250934355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:21:40,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:21:40,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 13:21:40,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736384923] [2024-11-16 13:21:40,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:21:40,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 13:21:40,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 13:21:40,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 13:21:40,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 13:21:40,904 INFO L87 Difference]: Start difference. First operand has 98 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 60 states have internal predecessors, (81), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-16 13:21:40,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:21:40,946 INFO L93 Difference]: Finished difference Result 187 states and 333 transitions. [2024-11-16 13:21:40,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 13:21:40,950 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 224 [2024-11-16 13:21:40,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:21:40,958 INFO L225 Difference]: With dead ends: 187 [2024-11-16 13:21:40,959 INFO L226 Difference]: Without dead ends: 92 [2024-11-16 13:21:40,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 223 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-16 13:21:40,969 INFO L432 NwaCegarLoop]: 141 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, 141 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-16 13:21:40,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 13:21:40,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-16 13:21:41,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-16 13:21:41,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 54 states have internal predecessors, (69), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 13:21:41,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 141 transitions. [2024-11-16 13:21:41,017 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 141 transitions. Word has length 224 [2024-11-16 13:21:41,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:21:41,017 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 141 transitions. [2024-11-16 13:21:41,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-16 13:21:41,018 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 141 transitions. [2024-11-16 13:21:41,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-16 13:21:41,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:21:41,023 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:21:41,062 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-16 13:21:41,223 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-16 13:21:41,224 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:21:41,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:21:41,225 INFO L85 PathProgramCache]: Analyzing trace with hash -850520066, now seen corresponding path program 1 times [2024-11-16 13:21:41,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:21:41,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1637065853] [2024-11-16 13:21:41,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:21:41,227 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-16 13:21:41,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:21:41,228 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-16 13:21:41,229 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-16 13:21:42,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:42,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 13:21:42,686 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:21:42,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-16 13:21:42,858 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 13:21:42,859 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 13:21:42,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1637065853] [2024-11-16 13:21:42,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1637065853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:21:42,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:21:42,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 13:21:42,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59749579] [2024-11-16 13:21:42,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:21:42,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 13:21:42,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 13:21:42,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 13:21:42,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 13:21:42,863 INFO L87 Difference]: Start difference. First operand 92 states and 141 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-16 13:21:43,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:21:43,148 INFO L93 Difference]: Finished difference Result 220 states and 337 transitions. [2024-11-16 13:21:43,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 13:21:43,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 224 [2024-11-16 13:21:43,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:21:43,155 INFO L225 Difference]: With dead ends: 220 [2024-11-16 13:21:43,155 INFO L226 Difference]: Without dead ends: 131 [2024-11-16 13:21:43,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 13:21:43,161 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 96 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 13:21:43,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 287 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 13:21:43,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-16 13:21:43,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2024-11-16 13:21:43,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 71 states have (on average 1.1971830985915493) internal successors, (85), 72 states have internal predecessors, (85), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-16 13:21:43,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 197 transitions. [2024-11-16 13:21:43,201 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 197 transitions. Word has length 224 [2024-11-16 13:21:43,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:21:43,202 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 197 transitions. [2024-11-16 13:21:43,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-16 13:21:43,205 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 197 transitions. [2024-11-16 13:21:43,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-16 13:21:43,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:21:43,213 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:21:43,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-16 13:21:43,413 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-16 13:21:43,414 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:21:43,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:21:43,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1847592419, now seen corresponding path program 1 times [2024-11-16 13:21:43,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:21:43,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2104183091] [2024-11-16 13:21:43,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:21:43,416 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-16 13:21:43,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:21:43,417 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-16 13:21:43,418 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-16 13:21:44,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:44,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 13:21:44,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:21:45,079 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-16 13:21:45,080 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 13:21:45,080 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 13:21:45,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2104183091] [2024-11-16 13:21:45,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2104183091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:21:45,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:21:45,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 13:21:45,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221790376] [2024-11-16 13:21:45,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:21:45,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 13:21:45,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 13:21:45,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 13:21:45,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 13:21:45,083 INFO L87 Difference]: Start difference. First operand 130 states and 197 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-16 13:21:49,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.44s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 13:21:54,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.40s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 13:21:54,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:21:54,467 INFO L93 Difference]: Finished difference Result 243 states and 365 transitions. [2024-11-16 13:21:54,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 13:21:54,468 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 224 [2024-11-16 13:21:54,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:21:54,474 INFO L225 Difference]: With dead ends: 243 [2024-11-16 13:21:54,474 INFO L226 Difference]: Without dead ends: 150 [2024-11-16 13:21:54,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 13:21:54,476 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 22 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2024-11-16 13:21:54,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 270 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 2 Unknown, 0 Unchecked, 9.4s Time] [2024-11-16 13:21:54,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-16 13:21:54,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 137. [2024-11-16 13:21:54,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 78 states have (on average 1.2179487179487178) internal successors, (95), 79 states have internal predecessors, (95), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-16 13:21:54,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 207 transitions. [2024-11-16 13:21:54,497 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 207 transitions. Word has length 224 [2024-11-16 13:21:54,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:21:54,498 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 207 transitions. [2024-11-16 13:21:54,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-16 13:21:54,499 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 207 transitions. [2024-11-16 13:21:54,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-16 13:21:54,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:21:54,502 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:21:54,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-16 13:21:54,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:21:54,703 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:21:54,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:21:54,703 INFO L85 PathProgramCache]: Analyzing trace with hash -960088738, now seen corresponding path program 1 times [2024-11-16 13:21:54,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:21:54,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1987237845] [2024-11-16 13:21:54,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:21:54,705 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-16 13:21:54,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:21:54,708 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 13:21:54,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-16 13:21:56,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:21:56,124 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 13:21:56,129 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:22:05,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-16 13:22:05,118 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 13:22:05,118 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 13:22:05,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1987237845] [2024-11-16 13:22:05,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1987237845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:22:05,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:22:05,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 13:22:05,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110263546] [2024-11-16 13:22:05,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:22:05,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 13:22:05,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 13:22:05,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 13:22:05,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 13:22:05,124 INFO L87 Difference]: Start difference. First operand 137 states and 207 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-16 13:22:09,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.41s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 13:22:14,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.41s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 13:22:14,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:22:14,445 INFO L93 Difference]: Finished difference Result 337 states and 507 transitions. [2024-11-16 13:22:14,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 13:22:14,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 224 [2024-11-16 13:22:14,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:22:14,450 INFO L225 Difference]: With dead ends: 337 [2024-11-16 13:22:14,450 INFO L226 Difference]: Without dead ends: 237 [2024-11-16 13:22:14,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 13:22:14,452 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 24 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2024-11-16 13:22:14,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 269 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 2 Unknown, 0 Unchecked, 9.3s Time] [2024-11-16 13:22:14,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-16 13:22:14,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 234. [2024-11-16 13:22:14,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 137 states have (on average 1.2335766423357664) internal successors, (169), 138 states have internal predecessors, (169), 92 states have call successors, (92), 4 states have call predecessors, (92), 4 states have return successors, (92), 91 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-16 13:22:14,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 353 transitions. [2024-11-16 13:22:14,494 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 353 transitions. Word has length 224 [2024-11-16 13:22:14,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:22:14,496 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 353 transitions. [2024-11-16 13:22:14,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-16 13:22:14,497 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 353 transitions. [2024-11-16 13:22:14,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-16 13:22:14,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:22:14,500 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:22:14,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-16 13:22:14,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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-16 13:22:14,702 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:22:14,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:22:14,702 INFO L85 PathProgramCache]: Analyzing trace with hash 560995530, now seen corresponding path program 1 times [2024-11-16 13:22:14,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:22:14,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1968166771] [2024-11-16 13:22:14,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:22:14,703 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-16 13:22:14,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:22:14,704 INFO L229 MonitoredProcess]: Starting monitored process 6 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-16 13:22:14,705 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 (6)] Waiting until timeout for monitored process [2024-11-16 13:22:16,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:22:16,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-16 13:22:16,216 INFO L278 TraceCheckSpWp]: Computing forward predicates...