./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-21.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-21.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 dd3e509a85a1a145df13b25b31acf4786a0b4df9db3cb7a4b510e8d9ede3e75f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 05:38:22,378 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 05:38:22,432 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 05:38:22,439 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 05:38:22,439 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 05:38:22,468 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 05:38:22,469 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 05:38:22,469 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 05:38:22,470 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 05:38:22,470 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 05:38:22,470 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 05:38:22,471 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 05:38:22,471 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 05:38:22,472 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 05:38:22,472 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 05:38:22,472 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 05:38:22,476 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 05:38:22,477 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 05:38:22,477 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 05:38:22,477 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 05:38:22,477 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 05:38:22,478 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 05:38:22,478 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 05:38:22,478 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 05:38:22,479 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 05:38:22,479 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 05:38:22,479 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 05:38:22,479 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 05:38:22,479 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 05:38:22,480 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 05:38:22,480 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 05:38:22,480 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 05:38:22,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:38:22,480 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 05:38:22,481 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 05:38:22,481 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 05:38:22,481 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 05:38:22,481 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 05:38:22,485 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 05:38:22,485 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 05:38:22,486 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 05:38:22,486 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 05:38:22,486 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 -> dd3e509a85a1a145df13b25b31acf4786a0b4df9db3cb7a4b510e8d9ede3e75f [2024-11-20 05:38:22,680 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 05:38:22,700 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 05:38:22,703 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 05:38:22,704 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 05:38:22,704 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 05:38:22,705 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-21.i [2024-11-20 05:38:24,124 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 05:38:24,306 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 05:38:24,306 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-21.i [2024-11-20 05:38:24,324 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63cd36501/5476a73a592c4afca65ce1fdd3e4c7e8/FLAGd65b6ff6e [2024-11-20 05:38:24,686 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63cd36501/5476a73a592c4afca65ce1fdd3e4c7e8 [2024-11-20 05:38:24,689 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 05:38:24,691 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 05:38:24,693 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 05:38:24,693 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 05:38:24,699 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 05:38:24,700 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:38:24" (1/1) ... [2024-11-20 05:38:24,702 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@553334f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:38:24, skipping insertion in model container [2024-11-20 05:38:24,702 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:38:24" (1/1) ... [2024-11-20 05:38:24,729 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 05:38:24,879 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_fillercodestructure_normal_file-21.i[913,926] [2024-11-20 05:38:24,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:38:24,958 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 05:38:24,968 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_fillercodestructure_normal_file-21.i[913,926] [2024-11-20 05:38:24,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:38:25,011 INFO L204 MainTranslator]: Completed translation [2024-11-20 05:38:25,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:38:25 WrapperNode [2024-11-20 05:38:25,020 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 05:38:25,021 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 05:38:25,021 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 05:38:25,021 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 05:38:25,036 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:38:25" (1/1) ... [2024-11-20 05:38:25,048 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:38:25" (1/1) ... [2024-11-20 05:38:25,085 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 177 [2024-11-20 05:38:25,085 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 05:38:25,086 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 05:38:25,086 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 05:38:25,086 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 05:38:25,107 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:38:25" (1/1) ... [2024-11-20 05:38:25,107 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:38:25" (1/1) ... [2024-11-20 05:38:25,110 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:38:25" (1/1) ... [2024-11-20 05:38:25,193 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-20 05:38:25,193 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:38:25" (1/1) ... [2024-11-20 05:38:25,193 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:38:25" (1/1) ... [2024-11-20 05:38:25,210 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:38:25" (1/1) ... [2024-11-20 05:38:25,213 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:38:25" (1/1) ... [2024-11-20 05:38:25,218 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:38:25" (1/1) ... [2024-11-20 05:38:25,221 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:38:25" (1/1) ... [2024-11-20 05:38:25,231 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 05:38:25,232 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 05:38:25,232 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 05:38:25,233 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 05:38:25,234 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:38:25" (1/1) ... [2024-11-20 05:38:25,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:38:25,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:38:25,269 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-20 05:38:25,277 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-20 05:38:25,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 05:38:25,311 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 05:38:25,312 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 05:38:25,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 05:38:25,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 05:38:25,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 05:38:25,372 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 05:38:25,374 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 05:38:25,677 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-20 05:38:25,677 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 05:38:25,692 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 05:38:25,694 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 05:38:25,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:38:25 BoogieIcfgContainer [2024-11-20 05:38:25,694 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 05:38:25,697 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 05:38:25,698 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 05:38:25,701 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 05:38:25,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:38:24" (1/3) ... [2024-11-20 05:38:25,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a3a4cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:38:25, skipping insertion in model container [2024-11-20 05:38:25,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:38:25" (2/3) ... [2024-11-20 05:38:25,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a3a4cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:38:25, skipping insertion in model container [2024-11-20 05:38:25,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:38:25" (3/3) ... [2024-11-20 05:38:25,706 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-21.i [2024-11-20 05:38:25,720 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 05:38:25,720 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 05:38:25,770 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 05:38:25,776 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;@73f7a164, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 05:38:25,776 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 05:38:25,780 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 50 states have internal predecessors, (65), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 05:38:25,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-20 05:38:25,790 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:38:25,791 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:38:25,791 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:38:25,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:38:25,796 INFO L85 PathProgramCache]: Analyzing trace with hash 767436212, now seen corresponding path program 1 times [2024-11-20 05:38:25,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:38:25,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115514847] [2024-11-20 05:38:25,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:38:25,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:38:25,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:26,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:38:26,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:26,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:38:26,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:26,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:38:26,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:26,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:38:26,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:26,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:38:26,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:26,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:38:26,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:26,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:38:26,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:26,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:38:26,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:26,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:38:26,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:26,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:38:26,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:26,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:38:26,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:26,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:38:26,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:26,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:38:26,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:26,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:38:26,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:26,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:38:26,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:26,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 05:38:26,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:26,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 05:38:26,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:26,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 05:38:26,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:26,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 05:38:26,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:26,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 05:38:26,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:26,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 05:38:26,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:26,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 05:38:26,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:26,141 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 05:38:26,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:38:26,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115514847] [2024-11-20 05:38:26,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115514847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:38:26,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:38:26,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 05:38:26,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586841438] [2024-11-20 05:38:26,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:38:26,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 05:38:26,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:38:26,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 05:38:26,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 05:38:26,176 INFO L87 Difference]: Start difference. First operand has 74 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 50 states have internal predecessors, (65), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-20 05:38:26,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:38:26,225 INFO L93 Difference]: Finished difference Result 141 states and 234 transitions. [2024-11-20 05:38:26,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 05:38:26,229 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 144 [2024-11-20 05:38:26,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:38:26,237 INFO L225 Difference]: With dead ends: 141 [2024-11-20 05:38:26,237 INFO L226 Difference]: Without dead ends: 70 [2024-11-20 05:38:26,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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-20 05:38:26,244 INFO L432 NwaCegarLoop]: 102 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, 102 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-20 05:38:26,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:38:26,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-20 05:38:26,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-20 05:38:26,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 states have internal predecessors, (58), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 05:38:26,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 102 transitions. [2024-11-20 05:38:26,328 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 102 transitions. Word has length 144 [2024-11-20 05:38:26,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:38:26,332 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 102 transitions. [2024-11-20 05:38:26,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-20 05:38:26,332 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 102 transitions. [2024-11-20 05:38:26,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-20 05:38:26,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:38:26,336 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:38:26,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 05:38:26,337 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:38:26,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:38:26,338 INFO L85 PathProgramCache]: Analyzing trace with hash -567994260, now seen corresponding path program 1 times [2024-11-20 05:38:26,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:38:26,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610304741] [2024-11-20 05:38:26,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:38:26,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:38:26,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:27,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:38:27,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:27,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:38:27,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:27,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:38:27,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:27,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:38:27,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:27,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:38:27,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:27,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:38:27,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:27,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:38:27,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:27,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:38:27,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:27,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:38:27,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:27,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:38:27,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:27,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:38:27,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:27,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:38:27,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:27,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:38:27,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:27,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:38:27,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:27,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:38:27,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:27,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 05:38:27,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:27,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 05:38:27,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:27,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 05:38:27,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:27,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 05:38:27,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:27,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 05:38:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:27,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 05:38:27,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:27,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 05:38:27,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:27,581 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 05:38:27,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:38:27,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610304741] [2024-11-20 05:38:27,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610304741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:38:27,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:38:27,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 05:38:27,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7903433] [2024-11-20 05:38:27,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:38:27,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 05:38:27,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:38:27,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 05:38:27,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-20 05:38:27,586 INFO L87 Difference]: Start difference. First operand 70 states and 102 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 05:38:27,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:38:27,901 INFO L93 Difference]: Finished difference Result 205 states and 292 transitions. [2024-11-20 05:38:27,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 05:38:27,901 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2024-11-20 05:38:27,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:38:27,904 INFO L225 Difference]: With dead ends: 205 [2024-11-20 05:38:27,905 INFO L226 Difference]: Without dead ends: 138 [2024-11-20 05:38:27,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-20 05:38:27,906 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 152 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 05:38:27,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 321 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 05:38:27,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-20 05:38:27,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 122. [2024-11-20 05:38:27,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 88 states have (on average 1.3068181818181819) internal successors, (115), 89 states have internal predecessors, (115), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-20 05:38:27,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 175 transitions. [2024-11-20 05:38:27,923 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 175 transitions. Word has length 144 [2024-11-20 05:38:27,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:38:27,924 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 175 transitions. [2024-11-20 05:38:27,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 05:38:27,925 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 175 transitions. [2024-11-20 05:38:27,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-20 05:38:27,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:38:27,926 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:38:27,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 05:38:27,927 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:38:27,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:38:27,927 INFO L85 PathProgramCache]: Analyzing trace with hash -309828822, now seen corresponding path program 1 times [2024-11-20 05:38:27,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:38:27,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150708641] [2024-11-20 05:38:27,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:38:27,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:38:27,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:27,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:38:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:28,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:38:28,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:28,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:38:28,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:28,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:38:28,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:28,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:38:28,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:28,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:38:28,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:28,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:38:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:28,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:38:28,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:28,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:38:28,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:28,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:38:28,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:28,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:38:28,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:28,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:38:28,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:28,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:38:28,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:28,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:38:28,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:28,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:38:28,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:28,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 05:38:28,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:28,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 05:38:28,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:28,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 05:38:28,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:28,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 05:38:28,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:28,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 05:38:28,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:28,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 05:38:28,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:28,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 05:38:28,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:28,035 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 05:38:28,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:38:28,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150708641] [2024-11-20 05:38:28,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150708641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:38:28,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:38:28,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 05:38:28,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844878737] [2024-11-20 05:38:28,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:38:28,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 05:38:28,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:38:28,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 05:38:28,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 05:38:28,037 INFO L87 Difference]: Start difference. First operand 122 states and 175 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 05:38:28,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:38:28,053 INFO L93 Difference]: Finished difference Result 231 states and 331 transitions. [2024-11-20 05:38:28,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 05:38:28,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2024-11-20 05:38:28,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:38:28,056 INFO L225 Difference]: With dead ends: 231 [2024-11-20 05:38:28,056 INFO L226 Difference]: Without dead ends: 112 [2024-11-20 05:38:28,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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-20 05:38:28,058 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 05:38:28,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 197 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:38:28,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-20 05:38:28,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-20 05:38:28,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 78 states have (on average 1.2435897435897436) internal successors, (97), 79 states have internal predecessors, (97), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-20 05:38:28,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 157 transitions. [2024-11-20 05:38:28,077 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 157 transitions. Word has length 144 [2024-11-20 05:38:28,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:38:28,080 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 157 transitions. [2024-11-20 05:38:28,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 05:38:28,080 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 157 transitions. [2024-11-20 05:38:28,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-20 05:38:28,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:38:28,082 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:38:28,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 05:38:28,082 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:38:28,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:38:28,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1579111510, now seen corresponding path program 1 times [2024-11-20 05:38:28,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:38:28,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721057725] [2024-11-20 05:38:28,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:38:28,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:38:28,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:28,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:38:28,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:28,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:38:28,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:28,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:38:28,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:28,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:38:28,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:28,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:38:28,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:28,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:38:28,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:28,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:38:28,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:28,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:38:28,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:28,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:38:28,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:28,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:38:28,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:28,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:38:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:28,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:38:28,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:28,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:38:28,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:28,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:38:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:28,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:38:28,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:28,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 05:38:28,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:28,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 05:38:28,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:28,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 05:38:28,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:28,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 05:38:28,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:28,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 05:38:28,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:28,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 05:38:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:28,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 05:38:28,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:28,219 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 05:38:28,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:38:28,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721057725] [2024-11-20 05:38:28,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721057725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:38:28,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:38:28,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 05:38:28,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901189071] [2024-11-20 05:38:28,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:38:28,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 05:38:28,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:38:28,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 05:38:28,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 05:38:28,226 INFO L87 Difference]: Start difference. First operand 112 states and 157 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 05:38:28,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:38:28,278 INFO L93 Difference]: Finished difference Result 200 states and 281 transitions. [2024-11-20 05:38:28,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 05:38:28,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2024-11-20 05:38:28,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:38:28,283 INFO L225 Difference]: With dead ends: 200 [2024-11-20 05:38:28,283 INFO L226 Difference]: Without dead ends: 91 [2024-11-20 05:38:28,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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-20 05:38:28,284 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 05:38:28,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 188 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:38:28,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-20 05:38:28,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-20 05:38:28,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 57 states have (on average 1.1578947368421053) internal successors, (66), 58 states have internal predecessors, (66), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-20 05:38:28,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 126 transitions. [2024-11-20 05:38:28,298 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 126 transitions. Word has length 144 [2024-11-20 05:38:28,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:38:28,298 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 126 transitions. [2024-11-20 05:38:28,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 05:38:28,299 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 126 transitions. [2024-11-20 05:38:28,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-20 05:38:28,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:38:28,300 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:38:28,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 05:38:28,301 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:38:28,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:38:28,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1533203773, now seen corresponding path program 1 times [2024-11-20 05:38:28,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:38:28,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244513583] [2024-11-20 05:38:28,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:38:28,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:38:28,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 05:38:28,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1446046009] [2024-11-20 05:38:28,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:38:28,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 05:38:28,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:38:28,371 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 05:38:28,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 05:38:28,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 05:38:28,531 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 05:38:28,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 05:38:28,654 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 05:38:28,656 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 05:38:28,657 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 05:38:28,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 05:38:28,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 05:38:28,865 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-20 05:38:28,949 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 05:38:28,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:38:28 BoogieIcfgContainer [2024-11-20 05:38:28,952 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 05:38:28,952 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 05:38:28,952 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 05:38:28,952 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 05:38:28,956 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:38:25" (3/4) ... [2024-11-20 05:38:28,958 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 05:38:28,959 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 05:38:28,960 INFO L158 Benchmark]: Toolchain (without parser) took 4269.18ms. Allocated memory was 155.2MB in the beginning and 302.0MB in the end (delta: 146.8MB). Free memory was 81.5MB in the beginning and 197.3MB in the end (delta: -115.8MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. [2024-11-20 05:38:28,963 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 155.2MB. Free memory is still 105.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 05:38:28,963 INFO L158 Benchmark]: CACSL2BoogieTranslator took 326.98ms. Allocated memory is still 155.2MB. Free memory was 81.3MB in the beginning and 64.9MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 05:38:28,963 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.71ms. Allocated memory is still 155.2MB. Free memory was 64.9MB in the beginning and 60.2MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 05:38:28,964 INFO L158 Benchmark]: Boogie Preprocessor took 145.49ms. Allocated memory was 155.2MB in the beginning and 243.3MB in the end (delta: 88.1MB). Free memory was 60.2MB in the beginning and 210.6MB in the end (delta: -150.4MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. [2024-11-20 05:38:28,964 INFO L158 Benchmark]: RCFGBuilder took 462.47ms. Allocated memory is still 243.3MB. Free memory was 210.6MB in the beginning and 184.4MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-20 05:38:28,964 INFO L158 Benchmark]: TraceAbstraction took 3254.49ms. Allocated memory was 243.3MB in the beginning and 302.0MB in the end (delta: 58.7MB). Free memory was 184.4MB in the beginning and 198.4MB in the end (delta: -14.0MB). Peak memory consumption was 45.8MB. Max. memory is 16.1GB. [2024-11-20 05:38:28,964 INFO L158 Benchmark]: Witness Printer took 7.27ms. Allocated memory is still 302.0MB. Free memory was 198.4MB in the beginning and 197.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 05:38:28,967 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 155.2MB. Free memory is still 105.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 326.98ms. Allocated memory is still 155.2MB. Free memory was 81.3MB in the beginning and 64.9MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.71ms. Allocated memory is still 155.2MB. Free memory was 64.9MB in the beginning and 60.2MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 145.49ms. Allocated memory was 155.2MB in the beginning and 243.3MB in the end (delta: 88.1MB). Free memory was 60.2MB in the beginning and 210.6MB in the end (delta: -150.4MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. * RCFGBuilder took 462.47ms. Allocated memory is still 243.3MB. Free memory was 210.6MB in the beginning and 184.4MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3254.49ms. Allocated memory was 243.3MB in the beginning and 302.0MB in the end (delta: 58.7MB). Free memory was 184.4MB in the beginning and 198.4MB in the end (delta: -14.0MB). Peak memory consumption was 45.8MB. Max. memory is 16.1GB. * Witness Printer took 7.27ms. Allocated memory is still 302.0MB. Free memory was 198.4MB in the beginning and 197.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 129, overapproximation of someBinaryArithmeticDOUBLEoperation at line 68. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 10; [L23] signed char var_1_3 = 1; [L24] signed char var_1_4 = 100; [L25] signed char var_1_5 = 5; [L26] signed char var_1_6 = 32; [L27] signed char var_1_7 = 32; [L28] unsigned short int var_1_8 = 8; [L29] unsigned short int var_1_10 = 21451; [L30] unsigned char var_1_12 = 8; [L31] unsigned short int var_1_13 = 16; [L32] unsigned short int var_1_16 = 53444; [L33] unsigned char var_1_17 = 0; [L34] unsigned char var_1_18 = 0; [L35] double var_1_19 = 1.2; [L36] signed char var_1_20 = 1; [L37] double var_1_21 = 10.5; [L38] double var_1_22 = 0.0; [L39] double var_1_23 = 10.4; [L40] double var_1_24 = 50.5; [L41] unsigned short int var_1_25 = 2; [L42] unsigned short int last_1_var_1_8 = 8; [L43] unsigned char last_1_var_1_12 = 8; [L44] unsigned short int last_1_var_1_13 = 16; [L45] unsigned char last_1_var_1_17 = 0; [L46] unsigned short int last_1_var_1_25 = 2; VAL [isInitial=0, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L133] isInitial = 1 [L134] FCALL initially() [L135] COND TRUE 1 [L136] CALL updateLastVariables() [L122] last_1_var_1_8 = var_1_8 [L123] last_1_var_1_12 = var_1_12 [L124] last_1_var_1_13 = var_1_13 [L125] last_1_var_1_17 = var_1_17 [L126] last_1_var_1_25 = var_1_25 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L136] RET updateLastVariables() [L137] CALL updateVariables() [L85] var_1_3 = __VERIFIER_nondet_char() [L86] CALL assume_abort_if_not(var_1_3 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L86] RET assume_abort_if_not(var_1_3 >= -127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L87] CALL assume_abort_if_not(var_1_3 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L87] RET assume_abort_if_not(var_1_3 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L88] var_1_4 = __VERIFIER_nondet_char() [L89] CALL assume_abort_if_not(var_1_4 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L89] RET assume_abort_if_not(var_1_4 >= -127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L90] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L90] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L91] var_1_5 = __VERIFIER_nondet_char() [L92] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=32, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=32, var_1_7=32, var_1_8=8] [L92] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=32, var_1_7=32, var_1_8=8] [L93] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=32, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=32, var_1_7=32, var_1_8=8] [L93] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=32, var_1_7=32, var_1_8=8] [L94] var_1_6 = __VERIFIER_nondet_char() [L95] CALL assume_abort_if_not(var_1_6 >= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=32, var_1_8=8] [L95] RET assume_abort_if_not(var_1_6 >= 31) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=32, var_1_8=8] [L96] CALL assume_abort_if_not(var_1_6 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=32, var_1_8=8] [L96] RET assume_abort_if_not(var_1_6 <= 63) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=32, var_1_8=8] [L97] var_1_7 = __VERIFIER_nondet_char() [L98] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L98] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L99] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L99] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L100] var_1_10 = __VERIFIER_nondet_ushort() [L101] CALL assume_abort_if_not(var_1_10 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L101] RET assume_abort_if_not(var_1_10 >= 16383) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L102] CALL assume_abort_if_not(var_1_10 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L102] RET assume_abort_if_not(var_1_10 <= 32767) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L103] var_1_16 = __VERIFIER_nondet_ushort() [L104] CALL assume_abort_if_not(var_1_16 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L104] RET assume_abort_if_not(var_1_16 >= 32767) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L105] CALL assume_abort_if_not(var_1_16 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L105] RET assume_abort_if_not(var_1_16 <= 65534) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L106] var_1_18 = __VERIFIER_nondet_uchar() [L107] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L107] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L108] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L108] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L109] var_1_20 = __VERIFIER_nondet_char() [L110] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L110] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L111] CALL assume_abort_if_not(var_1_20 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L111] RET assume_abort_if_not(var_1_20 <= 127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L112] var_1_21 = __VERIFIER_nondet_double() [L113] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L113] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L114] var_1_22 = __VERIFIER_nondet_double() [L115] CALL assume_abort_if_not((var_1_22 >= 4611686.018427382800e+12F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L115] RET assume_abort_if_not((var_1_22 >= 4611686.018427382800e+12F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L116] var_1_23 = __VERIFIER_nondet_double() [L117] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L117] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L118] var_1_24 = __VERIFIER_nondet_double() [L119] CALL assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L119] RET assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L137] RET updateVariables() [L138] CALL step() [L50] COND TRUE (last_1_var_1_8 < last_1_var_1_13) || last_1_var_1_17 [L51] var_1_25 = (((((last_1_var_1_12) > (last_1_var_1_12)) ? (last_1_var_1_12) : (last_1_var_1_12))) + var_1_7) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_25=8, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L55] signed long int stepLocal_1 = last_1_var_1_13; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, stepLocal_1=16, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_25=8, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L56] COND TRUE last_1_var_1_13 == stepLocal_1 [L57] var_1_12 = ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=0, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_25=8, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L59] var_1_8 = (((var_1_7 + var_1_6) + var_1_12) + (var_1_10 - var_1_12)) [L60] signed long int stepLocal_0 = -1000000; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, stepLocal_0=-1000000, var_1_10=-49153, var_1_12=0, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_25=8, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=16446] [L61] COND TRUE var_1_8 >= stepLocal_0 [L62] var_1_1 = ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=0, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=1, var_1_20=126, var_1_25=8, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=16446] [L66] signed char stepLocal_3 = var_1_1; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, stepLocal_3=1, var_1_10=-49153, var_1_12=0, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=1, var_1_20=126, var_1_25=8, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=16446] [L67] COND TRUE stepLocal_3 >= (var_1_5 - var_1_20) [L68] var_1_19 = (((((var_1_21) < ((var_1_22 - var_1_23))) ? (var_1_21) : ((var_1_22 - var_1_23)))) - var_1_24) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=0, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_1=1, var_1_20=126, var_1_25=8, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=16446] [L70] COND TRUE ((((((((last_1_var_1_12) > (var_1_6)) ? (last_1_var_1_12) : (var_1_6)))) < (last_1_var_1_8)) ? (((((last_1_var_1_12) > (var_1_6)) ? (last_1_var_1_12) : (var_1_6)))) : (last_1_var_1_8))) > (var_1_3 * last_1_var_1_25) [L71] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=0, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_1=1, var_1_20=126, var_1_25=8, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=16446] [L73] unsigned short int stepLocal_2 = var_1_25; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, stepLocal_2=8, var_1_10=-49153, var_1_12=0, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_1=1, var_1_20=126, var_1_25=8, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=16446] [L74] COND FALSE !(\read(var_1_17)) [L81] var_1_13 = (var_1_16 - var_1_10) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, stepLocal_2=8, var_1_10=-49153, var_1_12=0, var_1_13=16384, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_1=1, var_1_20=126, var_1_25=8, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=16446] [L138] RET step() [L139] CALL, EXPR property() [L129] EXPR ((((var_1_8 >= -1000000) ? (var_1_1 == ((signed char) ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) : (var_1_1 == ((signed char) (var_1_5 - ((var_1_6 - 8) + var_1_7))))) && (var_1_8 == ((unsigned short int) (((var_1_7 + var_1_6) + var_1_12) + (var_1_10 - var_1_12))))) && ((last_1_var_1_13 == last_1_var_1_13) ? (var_1_12 == ((unsigned char) ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))))) : 1)) && (var_1_17 ? ((((var_1_10 + var_1_12) << var_1_5) < var_1_25) ? (var_1_13 == ((unsigned short int) ((((var_1_7) < (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6)))))))) ? (var_1_7) : (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))))))))) : (var_1_13 == ((unsigned short int) (var_1_16 - (var_1_12 + var_1_12))))) : (var_1_13 == ((unsigned short int) (var_1_16 - var_1_10)))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=0, var_1_13=16384, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_1=1, var_1_20=126, var_1_25=8, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=16446] [L129] EXPR var_1_17 ? ((((var_1_10 + var_1_12) << var_1_5) < var_1_25) ? (var_1_13 == ((unsigned short int) ((((var_1_7) < (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6)))))))) ? (var_1_7) : (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))))))))) : (var_1_13 == ((unsigned short int) (var_1_16 - (var_1_12 + var_1_12))))) : (var_1_13 == ((unsigned short int) (var_1_16 - var_1_10))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=0, var_1_13=16384, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_1=1, var_1_20=126, var_1_25=8, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=16446] [L129] EXPR ((((var_1_8 >= -1000000) ? (var_1_1 == ((signed char) ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) : (var_1_1 == ((signed char) (var_1_5 - ((var_1_6 - 8) + var_1_7))))) && (var_1_8 == ((unsigned short int) (((var_1_7 + var_1_6) + var_1_12) + (var_1_10 - var_1_12))))) && ((last_1_var_1_13 == last_1_var_1_13) ? (var_1_12 == ((unsigned char) ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))))) : 1)) && (var_1_17 ? ((((var_1_10 + var_1_12) << var_1_5) < var_1_25) ? (var_1_13 == ((unsigned short int) ((((var_1_7) < (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6)))))))) ? (var_1_7) : (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))))))))) : (var_1_13 == ((unsigned short int) (var_1_16 - (var_1_12 + var_1_12))))) : (var_1_13 == ((unsigned short int) (var_1_16 - var_1_10)))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=0, var_1_13=16384, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_1=1, var_1_20=126, var_1_25=8, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=16446] [L129-L130] return (((((((var_1_8 >= -1000000) ? (var_1_1 == ((signed char) ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) : (var_1_1 == ((signed char) (var_1_5 - ((var_1_6 - 8) + var_1_7))))) && (var_1_8 == ((unsigned short int) (((var_1_7 + var_1_6) + var_1_12) + (var_1_10 - var_1_12))))) && ((last_1_var_1_13 == last_1_var_1_13) ? (var_1_12 == ((unsigned char) ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))))) : 1)) && (var_1_17 ? ((((var_1_10 + var_1_12) << var_1_5) < var_1_25) ? (var_1_13 == ((unsigned short int) ((((var_1_7) < (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6)))))))) ? (var_1_7) : (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))))))))) : (var_1_13 == ((unsigned short int) (var_1_16 - (var_1_12 + var_1_12))))) : (var_1_13 == ((unsigned short int) (var_1_16 - var_1_10))))) && ((((((((((last_1_var_1_12) > (var_1_6)) ? (last_1_var_1_12) : (var_1_6)))) < (last_1_var_1_8)) ? (((((last_1_var_1_12) > (var_1_6)) ? (last_1_var_1_12) : (var_1_6)))) : (last_1_var_1_8))) > (var_1_3 * last_1_var_1_25)) ? (var_1_17 == ((unsigned char) var_1_18)) : 1)) && ((var_1_1 >= (var_1_5 - var_1_20)) ? (var_1_19 == ((double) (((((var_1_21) < ((var_1_22 - var_1_23))) ? (var_1_21) : ((var_1_22 - var_1_23)))) - var_1_24))) : 1)) && (((last_1_var_1_8 < last_1_var_1_13) || last_1_var_1_17) ? (var_1_25 == ((unsigned short int) (((((last_1_var_1_12) > (last_1_var_1_12)) ? (last_1_var_1_12) : (last_1_var_1_12))) + var_1_7))) : (var_1_25 == ((unsigned short int) var_1_7))) ; [L139] RET, EXPR property() [L139] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=0, var_1_13=16384, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_1=1, var_1_20=126, var_1_25=8, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=16446] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=0, var_1_13=16384, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_1=1, var_1_20=126, var_1_25=8, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=16446] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 74 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 5, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 152 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 152 mSDsluCounter, 808 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 396 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 124 IncrementalHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 412 mSDtfsCounter, 124 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 213 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=2, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 16 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 868 NumberOfCodeBlocks, 868 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 572 ConstructedInterpolants, 0 QuantifiedInterpolants, 1265 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 3696/3696 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-20 05:38:28,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-21.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 dd3e509a85a1a145df13b25b31acf4786a0b4df9db3cb7a4b510e8d9ede3e75f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 05:38:31,176 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 05:38:31,248 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 05:38:31,252 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 05:38:31,253 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 05:38:31,278 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 05:38:31,280 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 05:38:31,280 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 05:38:31,281 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 05:38:31,281 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 05:38:31,282 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 05:38:31,283 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 05:38:31,283 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 05:38:31,283 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 05:38:31,283 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 05:38:31,284 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 05:38:31,286 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 05:38:31,286 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 05:38:31,286 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 05:38:31,287 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 05:38:31,287 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 05:38:31,287 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 05:38:31,287 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 05:38:31,289 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 05:38:31,290 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 05:38:31,290 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 05:38:31,290 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 05:38:31,290 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 05:38:31,290 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 05:38:31,290 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 05:38:31,291 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 05:38:31,291 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 05:38:31,291 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 05:38:31,291 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 05:38:31,291 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:38:31,291 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 05:38:31,291 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 05:38:31,292 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 05:38:31,292 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 05:38:31,292 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 05:38:31,292 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 05:38:31,293 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 05:38:31,293 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 05:38:31,294 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 05:38:31,294 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 -> dd3e509a85a1a145df13b25b31acf4786a0b4df9db3cb7a4b510e8d9ede3e75f [2024-11-20 05:38:31,555 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 05:38:31,588 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 05:38:31,590 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 05:38:31,591 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 05:38:31,592 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 05:38:31,593 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-21.i [2024-11-20 05:38:32,979 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 05:38:33,171 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 05:38:33,172 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-21.i [2024-11-20 05:38:33,180 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33614941d/ff21f97e95c24c4f8f3f7b77802dcb09/FLAG7a541710e [2024-11-20 05:38:33,192 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33614941d/ff21f97e95c24c4f8f3f7b77802dcb09 [2024-11-20 05:38:33,195 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 05:38:33,196 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 05:38:33,197 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 05:38:33,197 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 05:38:33,201 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 05:38:33,202 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:38:33" (1/1) ... [2024-11-20 05:38:33,203 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6897c376 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:38:33, skipping insertion in model container [2024-11-20 05:38:33,203 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:38:33" (1/1) ... [2024-11-20 05:38:33,242 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 05:38:33,399 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_fillercodestructure_normal_file-21.i[913,926] [2024-11-20 05:38:33,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:38:33,458 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 05:38:33,468 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_fillercodestructure_normal_file-21.i[913,926] [2024-11-20 05:38:33,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:38:33,502 INFO L204 MainTranslator]: Completed translation [2024-11-20 05:38:33,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:38:33 WrapperNode [2024-11-20 05:38:33,503 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 05:38:33,504 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 05:38:33,504 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 05:38:33,504 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 05:38:33,509 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:38:33" (1/1) ... [2024-11-20 05:38:33,519 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:38:33" (1/1) ... [2024-11-20 05:38:33,540 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 147 [2024-11-20 05:38:33,540 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 05:38:33,541 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 05:38:33,541 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 05:38:33,541 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 05:38:33,550 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:38:33" (1/1) ... [2024-11-20 05:38:33,550 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:38:33" (1/1) ... [2024-11-20 05:38:33,553 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:38:33" (1/1) ... [2024-11-20 05:38:33,564 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-20 05:38:33,564 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:38:33" (1/1) ... [2024-11-20 05:38:33,565 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:38:33" (1/1) ... [2024-11-20 05:38:33,571 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:38:33" (1/1) ... [2024-11-20 05:38:33,577 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:38:33" (1/1) ... [2024-11-20 05:38:33,579 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:38:33" (1/1) ... [2024-11-20 05:38:33,580 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:38:33" (1/1) ... [2024-11-20 05:38:33,583 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 05:38:33,584 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 05:38:33,584 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 05:38:33,584 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 05:38:33,585 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:38:33" (1/1) ... [2024-11-20 05:38:33,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:38:33,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:38:33,627 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-20 05:38:33,631 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-20 05:38:33,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 05:38:33,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 05:38:33,680 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 05:38:33,680 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 05:38:33,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 05:38:33,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 05:38:33,749 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 05:38:33,754 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 05:38:35,635 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-20 05:38:35,635 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 05:38:35,653 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 05:38:35,657 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 05:38:35,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:38:35 BoogieIcfgContainer [2024-11-20 05:38:35,657 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 05:38:35,659 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 05:38:35,659 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 05:38:35,662 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 05:38:35,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:38:33" (1/3) ... [2024-11-20 05:38:35,663 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ae665c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:38:35, skipping insertion in model container [2024-11-20 05:38:35,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:38:33" (2/3) ... [2024-11-20 05:38:35,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ae665c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:38:35, skipping insertion in model container [2024-11-20 05:38:35,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:38:35" (3/3) ... [2024-11-20 05:38:35,665 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-21.i [2024-11-20 05:38:35,680 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 05:38:35,681 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 05:38:35,729 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 05:38:35,735 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;@14fd9f53, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 05:38:35,735 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 05:38:35,739 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 40 states have (on average 1.3) internal successors, (52), 41 states have internal predecessors, (52), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 05:38:35,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-20 05:38:35,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:38:35,752 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:38:35,753 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:38:35,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:38:35,758 INFO L85 PathProgramCache]: Analyzing trace with hash 78302029, now seen corresponding path program 1 times [2024-11-20 05:38:35,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:38:35,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1829816768] [2024-11-20 05:38:35,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:38:35,769 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-20 05:38:35,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:38:35,786 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-20 05:38:35,787 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-20 05:38:36,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:36,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 05:38:36,095 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:38:36,127 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2024-11-20 05:38:36,128 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 05:38:36,128 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:38:36,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1829816768] [2024-11-20 05:38:36,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1829816768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:38:36,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:38:36,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 05:38:36,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171772108] [2024-11-20 05:38:36,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:38:36,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 05:38:36,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:38:36,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 05:38:36,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 05:38:36,157 INFO L87 Difference]: Start difference. First operand has 65 states, 40 states have (on average 1.3) internal successors, (52), 41 states have internal predecessors, (52), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-20 05:38:36,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:38:36,181 INFO L93 Difference]: Finished difference Result 123 states and 208 transitions. [2024-11-20 05:38:36,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 05:38:36,183 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 142 [2024-11-20 05:38:36,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:38:36,188 INFO L225 Difference]: With dead ends: 123 [2024-11-20 05:38:36,189 INFO L226 Difference]: Without dead ends: 61 [2024-11-20 05:38:36,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 141 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-20 05:38:36,194 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 05:38:36,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:38:36,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-20 05:38:36,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-20 05:38:36,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 05:38:36,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 89 transitions. [2024-11-20 05:38:36,226 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 89 transitions. Word has length 142 [2024-11-20 05:38:36,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:38:36,227 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 89 transitions. [2024-11-20 05:38:36,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-20 05:38:36,227 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 89 transitions. [2024-11-20 05:38:36,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-20 05:38:36,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:38:36,230 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:38:36,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-20 05:38:36,434 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-20 05:38:36,435 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:38:36,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:38:36,437 INFO L85 PathProgramCache]: Analyzing trace with hash 18811909, now seen corresponding path program 1 times [2024-11-20 05:38:36,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:38:36,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1930223343] [2024-11-20 05:38:36,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:38:36,439 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-20 05:38:36,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:38:36,444 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-20 05:38:36,454 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-20 05:38:36,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:38:37,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-20 05:38:37,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:39:09,140 WARN L286 SmtUtils]: Spent 5.19s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-20 05:39:38,520 WARN L286 SmtUtils]: Spent 5.55s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-20 05:40:01,630 WARN L286 SmtUtils]: Spent 5.18s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)