./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-66.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 b17426fcbd3c87a5dd89cb5e1501daf40166b5a166256cea7242083b05c82ceb --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:57:52,394 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:57:52,455 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:57:52,459 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:57:52,460 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:57:52,485 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:57:52,485 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:57:52,486 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:57:52,486 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:57:52,486 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:57:52,487 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:57:52,487 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:57:52,487 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:57:52,488 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:57:52,488 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:57:52,488 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:57:52,488 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:57:52,488 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:57:52,488 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:57:52,488 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:57:52,488 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:57:52,489 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:57:52,489 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:57:52,489 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:57:52,489 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:57:52,489 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:57:52,489 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:57:52,489 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:57:52,489 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:57:52,490 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:57:52,490 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:57:52,490 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:57:52,490 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:57:52,490 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:57:52,491 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:57:52,491 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:57:52,491 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:57:52,491 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:57:52,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:57:52,491 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:57:52,491 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:57:52,491 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:57:52,491 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:57:52,491 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> b17426fcbd3c87a5dd89cb5e1501daf40166b5a166256cea7242083b05c82ceb [2025-03-03 23:57:52,726 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:57:52,731 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:57:52,735 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:57:52,736 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:57:52,736 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:57:52,737 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-66.i [2025-03-03 23:57:53,915 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab95c1c6d/2fc2608c995940ecabe8cb3d72c90f22/FLAGb8a1eb32b [2025-03-03 23:57:54,144 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:57:54,145 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-66.i [2025-03-03 23:57:54,153 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab95c1c6d/2fc2608c995940ecabe8cb3d72c90f22/FLAGb8a1eb32b [2025-03-03 23:57:54,490 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab95c1c6d/2fc2608c995940ecabe8cb3d72c90f22 [2025-03-03 23:57:54,492 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:57:54,492 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:57:54,495 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:57:54,496 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:57:54,501 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:57:54,501 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:57:54" (1/1) ... [2025-03-03 23:57:54,502 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44a66a11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:54, skipping insertion in model container [2025-03-03 23:57:54,503 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:57:54" (1/1) ... [2025-03-03 23:57:54,519 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:57:54,621 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-66.i[916,929] [2025-03-03 23:57:54,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:57:54,691 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:57:54,699 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-66.i[916,929] [2025-03-03 23:57:54,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:57:54,751 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:57:54,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:54 WrapperNode [2025-03-03 23:57:54,751 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:57:54,753 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:57:54,753 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:57:54,753 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:57:54,759 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:54" (1/1) ... [2025-03-03 23:57:54,768 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:54" (1/1) ... [2025-03-03 23:57:54,811 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 216 [2025-03-03 23:57:54,812 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:57:54,812 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:57:54,812 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:57:54,812 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:57:54,819 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:54" (1/1) ... [2025-03-03 23:57:54,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:54" (1/1) ... [2025-03-03 23:57:54,826 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:54" (1/1) ... [2025-03-03 23:57:54,849 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]. [2025-03-03 23:57:54,852 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:54" (1/1) ... [2025-03-03 23:57:54,852 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:54" (1/1) ... [2025-03-03 23:57:54,860 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:54" (1/1) ... [2025-03-03 23:57:54,861 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:54" (1/1) ... [2025-03-03 23:57:54,862 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:54" (1/1) ... [2025-03-03 23:57:54,863 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:54" (1/1) ... [2025-03-03 23:57:54,865 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:57:54,866 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:57:54,866 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:57:54,866 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:57:54,867 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:54" (1/1) ... [2025-03-03 23:57:54,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:57:54,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:57:54,896 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) [2025-03-03 23:57:54,899 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 [2025-03-03 23:57:54,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:57:54,916 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:57:54,916 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:57:54,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:57:54,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:57:54,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:57:54,984 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:57:54,986 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:57:55,306 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L197: havoc property_#t~ite19#1;havoc property_#t~bitwise18#1;havoc property_#t~short20#1; [2025-03-03 23:57:55,330 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2025-03-03 23:57:55,331 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:57:55,342 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:57:55,343 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:57:55,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:57:55 BoogieIcfgContainer [2025-03-03 23:57:55,343 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:57:55,345 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:57:55,345 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:57:55,349 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:57:55,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:57:54" (1/3) ... [2025-03-03 23:57:55,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55e68592 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:57:55, skipping insertion in model container [2025-03-03 23:57:55,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:54" (2/3) ... [2025-03-03 23:57:55,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55e68592 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:57:55, skipping insertion in model container [2025-03-03 23:57:55,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:57:55" (3/3) ... [2025-03-03 23:57:55,351 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-66.i [2025-03-03 23:57:55,361 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:57:55,362 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount100_file-66.i that has 2 procedures, 89 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:57:55,398 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:57:55,405 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;@3dd2be4c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:57:55,406 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:57:55,408 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 65 states have (on average 1.4615384615384615) internal successors, (95), 66 states have internal predecessors, (95), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-03 23:57:55,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-03 23:57:55,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:57:55,417 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:57:55,417 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:57:55,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:57:55,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1473837003, now seen corresponding path program 1 times [2025-03-03 23:57:55,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:57:55,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105851264] [2025-03-03 23:57:55,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:57:55,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:57:55,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-03 23:57:55,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-03 23:57:55,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:57:55,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:57:55,710 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-03 23:57:55,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:57:55,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105851264] [2025-03-03 23:57:55,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105851264] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:57:55,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770590680] [2025-03-03 23:57:55,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:57:55,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:57:55,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:57:55,714 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) [2025-03-03 23:57:55,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 23:57:55,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-03 23:57:55,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-03 23:57:55,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:57:55,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:57:55,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:57:55,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:57:55,919 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-03 23:57:55,919 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:57:55,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770590680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:57:55,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:57:55,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 23:57:55,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058025226] [2025-03-03 23:57:55,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:57:55,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:57:55,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:57:55,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:57:55,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:57:55,941 INFO L87 Difference]: Start difference. First operand has 89 states, 65 states have (on average 1.4615384615384615) internal successors, (95), 66 states have internal predecessors, (95), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 23:57:55,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:57:55,970 INFO L93 Difference]: Finished difference Result 172 states and 290 transitions. [2025-03-03 23:57:55,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:57:55,972 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 149 [2025-03-03 23:57:55,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:57:55,977 INFO L225 Difference]: With dead ends: 172 [2025-03-03 23:57:55,978 INFO L226 Difference]: Without dead ends: 86 [2025-03-03 23:57:55,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:57:55,983 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:57:55,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:57:55,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-03 23:57:56,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-03-03 23:57:56,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 63 states have (on average 1.4285714285714286) internal successors, (90), 63 states have internal predecessors, (90), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-03 23:57:56,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 132 transitions. [2025-03-03 23:57:56,024 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 132 transitions. Word has length 149 [2025-03-03 23:57:56,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:57:56,026 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 132 transitions. [2025-03-03 23:57:56,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 23:57:56,026 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 132 transitions. [2025-03-03 23:57:56,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-03 23:57:56,031 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:57:56,031 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:57:56,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 23:57:56,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 23:57:56,232 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:57:56,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:57:56,232 INFO L85 PathProgramCache]: Analyzing trace with hash 375157998, now seen corresponding path program 1 times [2025-03-03 23:57:56,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:57:56,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162061001] [2025-03-03 23:57:56,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:57:56,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:57:56,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-03 23:57:56,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-03 23:57:56,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:57:56,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:57:56,464 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-03 23:57:56,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:57:56,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162061001] [2025-03-03 23:57:56,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162061001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:57:56,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:57:56,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 23:57:56,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512202235] [2025-03-03 23:57:56,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:57:56,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 23:57:56,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:57:56,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 23:57:56,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:57:56,466 INFO L87 Difference]: Start difference. First operand 86 states and 132 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-03 23:57:56,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:57:56,521 INFO L93 Difference]: Finished difference Result 208 states and 321 transitions. [2025-03-03 23:57:56,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 23:57:56,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 149 [2025-03-03 23:57:56,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:57:56,526 INFO L225 Difference]: With dead ends: 208 [2025-03-03 23:57:56,526 INFO L226 Difference]: Without dead ends: 125 [2025-03-03 23:57:56,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:57:56,527 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 57 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:57:56,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 299 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:57:56,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-03 23:57:56,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 88. [2025-03-03 23:57:56,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 65 states have (on average 1.4) internal successors, (91), 65 states have internal predecessors, (91), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-03 23:57:56,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 133 transitions. [2025-03-03 23:57:56,543 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 133 transitions. Word has length 149 [2025-03-03 23:57:56,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:57:56,544 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 133 transitions. [2025-03-03 23:57:56,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-03 23:57:56,545 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 133 transitions. [2025-03-03 23:57:56,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-03 23:57:56,546 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:57:56,546 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:57:56,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 23:57:56,546 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:57:56,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:57:56,547 INFO L85 PathProgramCache]: Analyzing trace with hash 308151245, now seen corresponding path program 1 times [2025-03-03 23:57:56,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:57:56,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589001674] [2025-03-03 23:57:56,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:57:56,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:57:56,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-03 23:57:56,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-03 23:57:56,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:57:56,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:57:57,247 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-03-03 23:57:57,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:57:57,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589001674] [2025-03-03 23:57:57,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589001674] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:57:57,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958175564] [2025-03-03 23:57:57,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:57:57,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:57:57,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:57:57,253 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:57:57,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 23:57:57,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-03 23:57:57,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-03 23:57:57,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:57:57,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:57:57,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 23:57:57,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:57:57,672 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 20 proven. 60 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 23:57:57,673 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:57:57,935 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-03-03 23:57:57,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958175564] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:57:57,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 23:57:57,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-03 23:57:57,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111098647] [2025-03-03 23:57:57,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 23:57:57,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 23:57:57,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:57:57,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 23:57:57,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-03 23:57:57,939 INFO L87 Difference]: Start difference. First operand 88 states and 133 transitions. Second operand has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 3 states have call successors, (61), 2 states have call predecessors, (61), 4 states have return successors, (62), 2 states have call predecessors, (62), 3 states have call successors, (62) [2025-03-03 23:57:58,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:57:58,161 INFO L93 Difference]: Finished difference Result 179 states and 268 transitions. [2025-03-03 23:57:58,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 23:57:58,163 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 3 states have call successors, (61), 2 states have call predecessors, (61), 4 states have return successors, (62), 2 states have call predecessors, (62), 3 states have call successors, (62) Word has length 149 [2025-03-03 23:57:58,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:57:58,165 INFO L225 Difference]: With dead ends: 179 [2025-03-03 23:57:58,165 INFO L226 Difference]: Without dead ends: 94 [2025-03-03 23:57:58,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-03-03 23:57:58,166 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 127 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 23:57:58,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 338 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 23:57:58,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-03 23:57:58,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2025-03-03 23:57:58,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 68 states have (on average 1.3676470588235294) internal successors, (93), 68 states have internal predecessors, (93), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-03 23:57:58,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 135 transitions. [2025-03-03 23:57:58,183 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 135 transitions. Word has length 149 [2025-03-03 23:57:58,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:57:58,183 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 135 transitions. [2025-03-03 23:57:58,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 3 states have call successors, (61), 2 states have call predecessors, (61), 4 states have return successors, (62), 2 states have call predecessors, (62), 3 states have call successors, (62) [2025-03-03 23:57:58,183 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 135 transitions. [2025-03-03 23:57:58,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-03 23:57:58,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:57:58,185 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:57:58,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 23:57:58,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-03 23:57:58,385 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:57:58,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:57:58,386 INFO L85 PathProgramCache]: Analyzing trace with hash -536320626, now seen corresponding path program 1 times [2025-03-03 23:57:58,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:57:58,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114521779] [2025-03-03 23:57:58,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:57:58,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:57:58,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-03 23:57:58,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-03 23:57:58,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:57:58,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:57:58,686 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-03 23:57:58,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:57:58,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114521779] [2025-03-03 23:57:58,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114521779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:57:58,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:57:58,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 23:57:58,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502096657] [2025-03-03 23:57:58,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:57:58,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 23:57:58,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:57:58,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 23:57:58,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:57:58,688 INFO L87 Difference]: Start difference. First operand 92 states and 135 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-03 23:57:58,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:57:58,715 INFO L93 Difference]: Finished difference Result 181 states and 267 transitions. [2025-03-03 23:57:58,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 23:57:58,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 149 [2025-03-03 23:57:58,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:57:58,718 INFO L225 Difference]: With dead ends: 181 [2025-03-03 23:57:58,718 INFO L226 Difference]: Without dead ends: 92 [2025-03-03 23:57:58,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:57:58,720 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 75 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:57:58,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 117 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:57:58,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-03 23:57:58,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-03 23:57:58,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 68 states have (on average 1.3235294117647058) internal successors, (90), 68 states have internal predecessors, (90), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-03 23:57:58,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 132 transitions. [2025-03-03 23:57:58,737 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 132 transitions. Word has length 149 [2025-03-03 23:57:58,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:57:58,737 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 132 transitions. [2025-03-03 23:57:58,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-03 23:57:58,738 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 132 transitions. [2025-03-03 23:57:58,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-03 23:57:58,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:57:58,739 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:57:58,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 23:57:58,739 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:57:58,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:57:58,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1657789200, now seen corresponding path program 1 times [2025-03-03 23:57:58,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:57:58,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409659073] [2025-03-03 23:57:58,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:57:58,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:57:58,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-03 23:57:58,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-03 23:57:58,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:57:58,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:57:58,942 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-03 23:57:58,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:57:58,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409659073] [2025-03-03 23:57:58,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409659073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:57:58,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:57:58,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 23:57:58,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716327229] [2025-03-03 23:57:58,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:57:58,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 23:57:58,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:57:58,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 23:57:58,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 23:57:58,946 INFO L87 Difference]: Start difference. First operand 92 states and 132 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-03 23:57:58,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:57:58,993 INFO L93 Difference]: Finished difference Result 181 states and 261 transitions. [2025-03-03 23:57:58,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 23:57:58,994 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 149 [2025-03-03 23:57:58,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:57:58,995 INFO L225 Difference]: With dead ends: 181 [2025-03-03 23:57:58,996 INFO L226 Difference]: Without dead ends: 92 [2025-03-03 23:57:58,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:57:58,997 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 69 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:57:58,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 229 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:57:58,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-03 23:57:59,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-03 23:57:59,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 68 states have internal predecessors, (89), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-03 23:57:59,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 131 transitions. [2025-03-03 23:57:59,012 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 131 transitions. Word has length 149 [2025-03-03 23:57:59,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:57:59,012 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 131 transitions. [2025-03-03 23:57:59,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-03 23:57:59,012 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 131 transitions. [2025-03-03 23:57:59,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 23:57:59,014 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:57:59,014 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:57:59,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 23:57:59,015 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:57:59,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:57:59,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1306171317, now seen corresponding path program 1 times [2025-03-03 23:57:59,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:57:59,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767561843] [2025-03-03 23:57:59,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:57:59,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:57:59,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 23:57:59,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 23:57:59,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:57:59,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:57:59,443 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-03-03 23:57:59,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:57:59,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767561843] [2025-03-03 23:57:59,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767561843] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:57:59,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211856086] [2025-03-03 23:57:59,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:57:59,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:57:59,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:57:59,446 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:57:59,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 23:57:59,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 23:57:59,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 23:57:59,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:57:59,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:57:59,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 23:57:59,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:57:59,958 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 284 proven. 48 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2025-03-03 23:57:59,959 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:58:00,234 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 12 proven. 48 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-03-03 23:58:00,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211856086] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:58:00,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 23:58:00,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 20 [2025-03-03 23:58:00,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389389444] [2025-03-03 23:58:00,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 23:58:00,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 23:58:00,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:58:00,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 23:58:00,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-03-03 23:58:00,236 INFO L87 Difference]: Start difference. First operand 92 states and 131 transitions. Second operand has 20 states, 20 states have (on average 7.1) internal successors, (142), 20 states have internal predecessors, (142), 6 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 6 states have call predecessors, (63), 6 states have call successors, (63) [2025-03-03 23:58:04,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:58:04,608 INFO L93 Difference]: Finished difference Result 1142 states and 1481 transitions. [2025-03-03 23:58:04,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2025-03-03 23:58:04,608 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 7.1) internal successors, (142), 20 states have internal predecessors, (142), 6 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 6 states have call predecessors, (63), 6 states have call successors, (63) Word has length 151 [2025-03-03 23:58:04,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:58:04,613 INFO L225 Difference]: With dead ends: 1142 [2025-03-03 23:58:04,613 INFO L226 Difference]: Without dead ends: 1053 [2025-03-03 23:58:04,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8495 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3401, Invalid=17479, Unknown=0, NotChecked=0, Total=20880 [2025-03-03 23:58:04,620 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 2362 mSDsluCounter, 1370 mSDsCounter, 0 mSdLazyCounter, 1609 mSolverCounterSat, 694 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2362 SdHoareTripleChecker+Valid, 1610 SdHoareTripleChecker+Invalid, 2303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 694 IncrementalHoareTripleChecker+Valid, 1609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 23:58:04,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2362 Valid, 1610 Invalid, 2303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [694 Valid, 1609 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 23:58:04,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2025-03-03 23:58:04,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 801. [2025-03-03 23:58:04,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 615 states have (on average 1.2227642276422763) internal successors, (752), 626 states have internal predecessors, (752), 144 states have call successors, (144), 41 states have call predecessors, (144), 41 states have return successors, (144), 133 states have call predecessors, (144), 144 states have call successors, (144) [2025-03-03 23:58:04,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1040 transitions. [2025-03-03 23:58:04,709 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1040 transitions. Word has length 151 [2025-03-03 23:58:04,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:58:04,709 INFO L471 AbstractCegarLoop]: Abstraction has 801 states and 1040 transitions. [2025-03-03 23:58:04,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 7.1) internal successors, (142), 20 states have internal predecessors, (142), 6 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 6 states have call predecessors, (63), 6 states have call successors, (63) [2025-03-03 23:58:04,709 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1040 transitions. [2025-03-03 23:58:04,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 23:58:04,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:58:04,711 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:58:04,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 23:58:04,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:58:04,915 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:58:04,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:58:04,916 INFO L85 PathProgramCache]: Analyzing trace with hash 25597945, now seen corresponding path program 1 times [2025-03-03 23:58:04,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:58:04,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244766931] [2025-03-03 23:58:04,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:58:04,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:58:04,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 23:58:04,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 23:58:04,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:58:04,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:58:05,026 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-03 23:58:05,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:58:05,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244766931] [2025-03-03 23:58:05,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244766931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:58:05,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:58:05,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 23:58:05,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046035450] [2025-03-03 23:58:05,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:58:05,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 23:58:05,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:58:05,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 23:58:05,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:58:05,029 INFO L87 Difference]: Start difference. First operand 801 states and 1040 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-03 23:58:05,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:58:05,317 INFO L93 Difference]: Finished difference Result 2665 states and 3449 transitions. [2025-03-03 23:58:05,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 23:58:05,318 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 152 [2025-03-03 23:58:05,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:58:05,331 INFO L225 Difference]: With dead ends: 2665 [2025-03-03 23:58:05,331 INFO L226 Difference]: Without dead ends: 1867 [2025-03-03 23:58:05,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 23:58:05,335 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 382 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 23:58:05,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 730 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 23:58:05,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1867 states. [2025-03-03 23:58:05,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1867 to 1372. [2025-03-03 23:58:05,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1372 states, 1056 states have (on average 1.2140151515151516) internal successors, (1282), 1076 states have internal predecessors, (1282), 244 states have call successors, (244), 71 states have call predecessors, (244), 71 states have return successors, (244), 224 states have call predecessors, (244), 244 states have call successors, (244) [2025-03-03 23:58:05,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1770 transitions. [2025-03-03 23:58:05,461 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1770 transitions. Word has length 152 [2025-03-03 23:58:05,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:58:05,461 INFO L471 AbstractCegarLoop]: Abstraction has 1372 states and 1770 transitions. [2025-03-03 23:58:05,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-03 23:58:05,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1770 transitions. [2025-03-03 23:58:05,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 23:58:05,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:58:05,463 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:58:05,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 23:58:05,463 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:58:05,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:58:05,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1702483153, now seen corresponding path program 1 times [2025-03-03 23:58:05,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:58:05,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053198129] [2025-03-03 23:58:05,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:58:05,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:58:05,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 23:58:05,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 23:58:05,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:58:05,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:58:05,977 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 15 proven. 99 refuted. 0 times theorem prover too weak. 726 trivial. 0 not checked. [2025-03-03 23:58:05,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:58:05,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053198129] [2025-03-03 23:58:05,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053198129] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:58:05,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451199507] [2025-03-03 23:58:05,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:58:05,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:58:05,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:58:05,980 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:58:05,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 23:58:06,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 23:58:06,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 23:58:06,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:58:06,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:58:06,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-03 23:58:06,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:58:06,729 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 134 proven. 3 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-03 23:58:06,729 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:58:07,223 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 57 proven. 3 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-03-03 23:58:07,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451199507] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:58:07,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 23:58:07,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 8] total 23 [2025-03-03 23:58:07,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944052255] [2025-03-03 23:58:07,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 23:58:07,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 23:58:07,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:58:07,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 23:58:07,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2025-03-03 23:58:07,226 INFO L87 Difference]: Start difference. First operand 1372 states and 1770 transitions. Second operand has 23 states, 22 states have (on average 6.0) internal successors, (132), 22 states have internal predecessors, (132), 8 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 7 states have call predecessors, (63), 8 states have call successors, (63) [2025-03-03 23:58:11,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:58:11,057 INFO L93 Difference]: Finished difference Result 5088 states and 6624 transitions. [2025-03-03 23:58:11,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-03-03 23:58:11,058 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 6.0) internal successors, (132), 22 states have internal predecessors, (132), 8 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 7 states have call predecessors, (63), 8 states have call successors, (63) Word has length 152 [2025-03-03 23:58:11,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:58:11,073 INFO L225 Difference]: With dead ends: 5088 [2025-03-03 23:58:11,074 INFO L226 Difference]: Without dead ends: 3719 [2025-03-03 23:58:11,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4034 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1907, Invalid=9865, Unknown=0, NotChecked=0, Total=11772 [2025-03-03 23:58:11,081 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 3211 mSDsluCounter, 1223 mSDsCounter, 0 mSdLazyCounter, 1618 mSolverCounterSat, 829 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3250 SdHoareTripleChecker+Valid, 1327 SdHoareTripleChecker+Invalid, 2447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 829 IncrementalHoareTripleChecker+Valid, 1618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 23:58:11,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3250 Valid, 1327 Invalid, 2447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [829 Valid, 1618 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 23:58:11,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3719 states. [2025-03-03 23:58:11,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3719 to 2264. [2025-03-03 23:58:11,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2264 states, 1784 states have (on average 1.2242152466367713) internal successors, (2184), 1814 states have internal predecessors, (2184), 358 states have call successors, (358), 121 states have call predecessors, (358), 121 states have return successors, (358), 328 states have call predecessors, (358), 358 states have call successors, (358) [2025-03-03 23:58:11,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2264 states to 2264 states and 2900 transitions. [2025-03-03 23:58:11,306 INFO L78 Accepts]: Start accepts. Automaton has 2264 states and 2900 transitions. Word has length 152 [2025-03-03 23:58:11,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:58:11,306 INFO L471 AbstractCegarLoop]: Abstraction has 2264 states and 2900 transitions. [2025-03-03 23:58:11,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 6.0) internal successors, (132), 22 states have internal predecessors, (132), 8 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 7 states have call predecessors, (63), 8 states have call successors, (63) [2025-03-03 23:58:11,307 INFO L276 IsEmpty]: Start isEmpty. Operand 2264 states and 2900 transitions. [2025-03-03 23:58:11,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 23:58:11,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:58:11,309 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:58:11,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 23:58:11,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:58:11,510 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:58:11,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:58:11,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1129338640, now seen corresponding path program 1 times [2025-03-03 23:58:11,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:58:11,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677338184] [2025-03-03 23:58:11,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:58:11,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:58:11,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 23:58:11,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 23:58:11,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:58:11,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:58:11,704 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-03-03 23:58:11,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:58:11,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677338184] [2025-03-03 23:58:11,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677338184] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:58:11,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503878144] [2025-03-03 23:58:11,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:58:11,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:58:11,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:58:11,707 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:58:11,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 23:58:11,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 23:58:11,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 23:58:11,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:58:11,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:58:11,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 23:58:11,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:58:11,999 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 168 proven. 54 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2025-03-03 23:58:11,999 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:58:12,163 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-03-03 23:58:12,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503878144] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:58:12,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 23:58:12,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-03 23:58:12,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173679201] [2025-03-03 23:58:12,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 23:58:12,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 23:58:12,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:58:12,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 23:58:12,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-03 23:58:12,165 INFO L87 Difference]: Start difference. First operand 2264 states and 2900 transitions. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 3 states have call successors, (57), 2 states have call predecessors, (57), 4 states have return successors, (58), 3 states have call predecessors, (58), 3 states have call successors, (58) [2025-03-03 23:58:12,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:58:12,426 INFO L93 Difference]: Finished difference Result 4783 states and 6095 transitions. [2025-03-03 23:58:12,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 23:58:12,428 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 3 states have call successors, (57), 2 states have call predecessors, (57), 4 states have return successors, (58), 3 states have call predecessors, (58), 3 states have call successors, (58) Word has length 152 [2025-03-03 23:58:12,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:58:12,439 INFO L225 Difference]: With dead ends: 4783 [2025-03-03 23:58:12,439 INFO L226 Difference]: Without dead ends: 2522 [2025-03-03 23:58:12,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2025-03-03 23:58:12,444 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 164 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:58:12,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 337 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:58:12,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2522 states. [2025-03-03 23:58:12,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2522 to 2264. [2025-03-03 23:58:12,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2264 states, 1784 states have (on average 1.201793721973094) internal successors, (2144), 1814 states have internal predecessors, (2144), 358 states have call successors, (358), 121 states have call predecessors, (358), 121 states have return successors, (358), 328 states have call predecessors, (358), 358 states have call successors, (358) [2025-03-03 23:58:12,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2264 states to 2264 states and 2860 transitions. [2025-03-03 23:58:12,648 INFO L78 Accepts]: Start accepts. Automaton has 2264 states and 2860 transitions. Word has length 152 [2025-03-03 23:58:12,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:58:12,650 INFO L471 AbstractCegarLoop]: Abstraction has 2264 states and 2860 transitions. [2025-03-03 23:58:12,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 3 states have call successors, (57), 2 states have call predecessors, (57), 4 states have return successors, (58), 3 states have call predecessors, (58), 3 states have call successors, (58) [2025-03-03 23:58:12,650 INFO L276 IsEmpty]: Start isEmpty. Operand 2264 states and 2860 transitions. [2025-03-03 23:58:12,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 23:58:12,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:58:12,655 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:58:12,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 23:58:12,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:58:12,856 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:58:12,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:58:12,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1258421359, now seen corresponding path program 1 times [2025-03-03 23:58:12,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:58:12,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589233244] [2025-03-03 23:58:12,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:58:12,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:58:12,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 23:58:12,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 23:58:12,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:58:12,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 23:58:12,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [129790950] [2025-03-03 23:58:12,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:58:12,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:58:12,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:58:12,962 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:58:12,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 23:58:13,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 23:58:13,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 23:58:13,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:58:13,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:58:13,087 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 23:58:13,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 23:58:13,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 23:58:13,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:58:13,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:58:13,208 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 23:58:13,208 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 23:58:13,209 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 23:58:13,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 23:58:13,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:58:13,413 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:58:13,505 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 23:58:13,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:58:13 BoogieIcfgContainer [2025-03-03 23:58:13,508 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 23:58:13,509 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 23:58:13,509 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 23:58:13,509 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 23:58:13,510 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:57:55" (3/4) ... [2025-03-03 23:58:13,511 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 23:58:13,511 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 23:58:13,512 INFO L158 Benchmark]: Toolchain (without parser) took 19019.58ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 135.0MB in the beginning and 208.7MB in the end (delta: -73.7MB). Peak memory consumption was 141.4MB. Max. memory is 16.1GB. [2025-03-03 23:58:13,512 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:58:13,512 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.17ms. Allocated memory is still 167.8MB. Free memory was 134.6MB in the beginning and 118.4MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 23:58:13,512 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.79ms. Allocated memory is still 167.8MB. Free memory was 118.4MB in the beginning and 114.8MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:58:13,513 INFO L158 Benchmark]: Boogie Preprocessor took 53.18ms. Allocated memory is still 167.8MB. Free memory was 114.8MB in the beginning and 108.8MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:58:13,513 INFO L158 Benchmark]: IcfgBuilder took 477.35ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 79.9MB in the end (delta: 28.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 23:58:13,513 INFO L158 Benchmark]: TraceAbstraction took 18163.57ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 79.2MB in the beginning and 208.8MB in the end (delta: -129.6MB). Peak memory consumption was 82.7MB. Max. memory is 16.1GB. [2025-03-03 23:58:13,513 INFO L158 Benchmark]: Witness Printer took 2.58ms. Allocated memory is still 385.9MB. Free memory was 208.8MB in the beginning and 208.7MB in the end (delta: 87.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:58:13,514 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.24ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 259.17ms. Allocated memory is still 167.8MB. Free memory was 134.6MB in the beginning and 118.4MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.79ms. Allocated memory is still 167.8MB. Free memory was 118.4MB in the beginning and 114.8MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 53.18ms. Allocated memory is still 167.8MB. Free memory was 114.8MB in the beginning and 108.8MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 477.35ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 79.9MB in the end (delta: 28.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 18163.57ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 79.2MB in the beginning and 208.8MB in the end (delta: -129.6MB). Peak memory consumption was 82.7MB. Max. memory is 16.1GB. * Witness Printer took 2.58ms. Allocated memory is still 385.9MB. Free memory was 208.8MB in the beginning and 208.7MB in the end (delta: 87.7kB). 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 shiftLeft at line 144, overapproximation of someBinaryArithmeticDOUBLEoperation at line 117, overapproximation of someBinaryArithmeticDOUBLEoperation at line 99, overapproximation of someBinaryArithmeticDOUBLEoperation at line 120, overapproximation of someBinaryFLOATComparisonOperation at line 197, overapproximation of someBinaryFLOATComparisonOperation at line 197, overapproximation of someBinaryFLOATComparisonOperation at line 185, overapproximation of someBinaryFLOATComparisonOperation at line 174, overapproximation of someBinaryDOUBLEComparisonOperation at line 170, overapproximation of someBinaryDOUBLEComparisonOperation at line 119, overapproximation of someBinaryDOUBLEComparisonOperation at line 197, overapproximation of someBinaryDOUBLEComparisonOperation at line 168, overapproximation of someBinaryDOUBLEComparisonOperation at line 172, overapproximation of someBinaryDOUBLEComparisonOperation at line 125. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 64; [L23] unsigned short int var_1_5 = 63575; [L24] unsigned long int var_1_6 = 10; [L25] unsigned long int var_1_8 = 3366149252; [L26] signed long int var_1_9 = -10; [L27] signed long int var_1_11 = 1938698816; [L28] unsigned char var_1_12 = 5; [L29] unsigned char var_1_13 = 64; [L30] unsigned char var_1_14 = 64; [L31] double var_1_15 = 99.625; [L32] double var_1_16 = 0.0; [L33] double var_1_17 = 999.5; [L34] double var_1_18 = 9.35; [L35] float var_1_19 = 99.875; [L36] float var_1_20 = 10000.71; [L37] double var_1_21 = 1000.5; [L38] double var_1_23 = 15.25; [L39] signed long int var_1_24 = 8; [L40] unsigned short int var_1_25 = 32; [L41] signed short int var_1_26 = 2; [L42] unsigned char var_1_27 = 0; [L43] unsigned char var_1_28 = 0; [L44] unsigned char var_1_29 = 0; [L45] unsigned char var_1_30 = 1; [L46] unsigned char var_1_32 = 0; [L47] float var_1_33 = 64.75; [L48] float var_1_34 = 9.2; [L49] unsigned short int last_1_var_1_1 = 64; [L50] signed long int last_1_var_1_9 = -10; [L51] unsigned char last_1_var_1_12 = 5; [L52] signed long int last_1_var_1_24 = 8; [L53] unsigned short int last_1_var_1_25 = 32; [L54] unsigned char last_1_var_1_27 = 0; [L55] unsigned char last_1_var_1_29 = 0; VAL [isInitial=0, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=63575, var_1_6=10, var_1_8=3366149252, var_1_9=-10] [L201] isInitial = 1 [L202] FCALL initially() [L203] COND TRUE 1 [L204] CALL updateLastVariables() [L188] last_1_var_1_1 = var_1_1 [L189] last_1_var_1_9 = var_1_9 [L190] last_1_var_1_12 = var_1_12 [L191] last_1_var_1_24 = var_1_24 [L192] last_1_var_1_25 = var_1_25 [L193] last_1_var_1_27 = var_1_27 [L194] last_1_var_1_29 = var_1_29 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=63575, var_1_6=10, var_1_8=3366149252, var_1_9=-10] [L204] RET updateLastVariables() [L205] CALL updateVariables() [L152] var_1_5 = __VERIFIER_nondet_ushort() [L153] CALL assume_abort_if_not(var_1_5 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=3366149252, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=3366149252, var_1_9=-10] [L153] RET assume_abort_if_not(var_1_5 >= 32767) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=3366149252, var_1_9=-10] [L154] CALL assume_abort_if_not(var_1_5 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=3366149252, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=3366149252, var_1_9=-10] [L154] RET assume_abort_if_not(var_1_5 <= 65534) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=3366149252, var_1_9=-10] [L155] var_1_8 = __VERIFIER_nondet_ulong() [L156] CALL assume_abort_if_not(var_1_8 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L156] RET assume_abort_if_not(var_1_8 >= 2147483647) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L157] CALL assume_abort_if_not(var_1_8 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L157] RET assume_abort_if_not(var_1_8 <= 4294967294) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1938698816, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L158] var_1_11 = __VERIFIER_nondet_long() [L159] CALL assume_abort_if_not(var_1_11 >= 1073741822) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L159] RET assume_abort_if_not(var_1_11 >= 1073741822) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L160] CALL assume_abort_if_not(var_1_11 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L160] RET assume_abort_if_not(var_1_11 <= 2147483646) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=64, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L161] var_1_13 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L162] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L163] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L163] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=64, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L164] var_1_14 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_14 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L165] RET assume_abort_if_not(var_1_14 >= 63) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L166] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L166] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_16=0, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L167] var_1_16 = __VERIFIER_nondet_double() [L168] CALL assume_abort_if_not((var_1_16 >= 4611686.018427382800e+12F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L168] RET assume_abort_if_not((var_1_16 >= 4611686.018427382800e+12F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_17=1999/2, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L169] var_1_17 = __VERIFIER_nondet_double() [L170] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L170] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_18=187/20, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L171] var_1_18 = __VERIFIER_nondet_double() [L172] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L172] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_20=1000071/100, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L173] var_1_20 = __VERIFIER_nondet_float() [L174] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L174] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L175] var_1_28 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_28 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L176] RET assume_abort_if_not(var_1_28 >= 1) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L177] CALL assume_abort_if_not(var_1_28 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L177] RET assume_abort_if_not(var_1_28 <= 1) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L178] var_1_30 = __VERIFIER_nondet_uchar() [L179] CALL assume_abort_if_not(var_1_30 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L179] RET assume_abort_if_not(var_1_30 >= 1) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L180] CALL assume_abort_if_not(var_1_30 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L180] RET assume_abort_if_not(var_1_30 <= 1) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L181] var_1_32 = __VERIFIER_nondet_uchar() [L182] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L182] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L183] CALL assume_abort_if_not(var_1_32 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L183] RET assume_abort_if_not(var_1_32 <= 0) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_34=46/5, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L184] var_1_34 = __VERIFIER_nondet_float() [L185] CALL assume_abort_if_not((var_1_34 >= -461168.6018427382800e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 4611686.018427382800e+12F && var_1_34 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L185] RET assume_abort_if_not((var_1_34 >= -461168.6018427382800e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 4611686.018427382800e+12F && var_1_34 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L205] RET updateVariables() [L206] CALL step() [L59] signed long int stepLocal_8 = 10000000; [L60] unsigned long int stepLocal_7 = 128u + last_1_var_1_1; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_7=192, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L61] COND FALSE !(last_1_var_1_24 >= stepLocal_7) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L66] COND FALSE !(last_1_var_1_12 >= last_1_var_1_24) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=5, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L71] COND FALSE !(\read(last_1_var_1_29)) [L74] var_1_12 = (32 + ((((var_1_14 - 2) < 0 ) ? -(var_1_14 - 2) : (var_1_14 - 2)))) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=-10] [L76] COND FALSE !(\read(last_1_var_1_29)) [L83] var_1_9 = ((var_1_11 - 16) - last_1_var_1_24) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=1073741798] [L85] unsigned char stepLocal_4 = var_1_14; [L86] unsigned char stepLocal_3 = last_1_var_1_27; [L87] unsigned char stepLocal_2 = last_1_var_1_27; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_2=0, stepLocal_3=0, stepLocal_4=63, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=8, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=1073741798] [L88] COND TRUE (var_1_13 * (var_1_5 * last_1_var_1_9)) <= stepLocal_4 [L89] var_1_24 = 50 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_15=797/8, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=1073741798] [L99] var_1_15 = ((var_1_16 - var_1_17) - var_1_18) [L100] unsigned long int stepLocal_9 = 50u; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, stepLocal_9=50, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=1073741798] [L101] COND FALSE !(stepLocal_9 >= var_1_5) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=1073741798] [L104] unsigned char stepLocal_12 = var_1_26 > var_1_1; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_12=0, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=259/4, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=1073741798] [L105] COND FALSE !(var_1_32 || stepLocal_12) [L108] var_1_33 = var_1_16 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=1073741798] [L110] signed short int stepLocal_1 = var_1_26; [L111] signed long int stepLocal_0 = var_1_24; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_1=2, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_19=799/8, var_1_1=64, var_1_21=2001/2, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=1073741798] [L112] COND FALSE !(stepLocal_1 >= (var_1_26 + (var_1_14 * 16))) [L117] var_1_21 = (((((1.75) < (var_1_18)) ? (1.75) : (var_1_18))) - (9.9999999995E9 + var_1_17)) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_19=799/8, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=1073741798] [L119] COND TRUE var_1_33 >= 0.25 [L120] var_1_19 = (var_1_17 + var_1_20) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=1073741798] [L122] COND FALSE !(\read(var_1_27)) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=32767, var_1_6=10, var_1_8=2147483647, var_1_9=1073741798] [L125] COND TRUE (var_1_33 * 8.2) < 10.4 [L126] var_1_6 = (var_1_8 - var_1_9) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=32767, var_1_6=1073741849, var_1_8=2147483647, var_1_9=1073741798] [L128] signed long int stepLocal_6 = 0; [L129] unsigned long int stepLocal_5 = 25u; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_2=0, stepLocal_3=0, stepLocal_5=25, stepLocal_6=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=32767, var_1_6=1073741849, var_1_8=2147483647, var_1_9=1073741798] [L130] COND FALSE !(stepLocal_6 >= ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6)))) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_2=0, stepLocal_3=0, stepLocal_5=25, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=32767, var_1_6=1073741849, var_1_8=2147483647, var_1_9=1073741798] [L135] COND FALSE !(var_1_8 < stepLocal_5) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=32767, var_1_6=1073741849, var_1_8=2147483647, var_1_9=1073741798] [L139] signed long int stepLocal_11 = (((var_1_12) < (var_1_14)) ? (var_1_12) : (var_1_14)); [L140] unsigned char stepLocal_10 = var_1_27; VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_10=0, stepLocal_11=63, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=32767, var_1_6=1073741849, var_1_8=2147483647, var_1_9=1073741798] [L141] COND FALSE !(var_1_28 && stepLocal_10) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_11=63, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=32767, var_1_6=1073741849, var_1_8=2147483647, var_1_9=1073741798] [L144] EXPR -25 << var_1_9 VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_11=63, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=32767, var_1_6=1073741849, var_1_8=2147483647, var_1_9=1073741798] [L144] COND TRUE stepLocal_11 > (-25 << var_1_9) [L145] var_1_29 = (var_1_27 || var_1_28) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, stepLocal_0=50, stepLocal_2=0, stepLocal_3=0, stepLocal_8=10000000, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=32767, var_1_6=1073741849, var_1_8=2147483647, var_1_9=1073741798] [L206] RET step() [L207] CALL, EXPR property() [L197] EXPR (((((((((((((last_1_var_1_12 >= last_1_var_1_24) ? (last_1_var_1_29 ? (var_1_1 == ((unsigned short int) (var_1_5 - last_1_var_1_12))) : 1) : 1) && (((var_1_33 * 8.2) < 10.4) ? (var_1_6 == ((unsigned long int) (var_1_8 - var_1_9))) : 1)) && (last_1_var_1_29 ? (last_1_var_1_29 ? (var_1_9 == ((signed long int) (last_1_var_1_24 + 100))) : (var_1_9 == ((signed long int) (((((var_1_5 + last_1_var_1_24)) > (last_1_var_1_9)) ? ((var_1_5 + last_1_var_1_24)) : (last_1_var_1_9)))))) : (var_1_9 == ((signed long int) ((var_1_11 - 16) - last_1_var_1_24))))) && (last_1_var_1_29 ? (var_1_12 == ((unsigned char) (64 + var_1_13))) : (var_1_12 == ((unsigned char) (32 + ((((var_1_14 - 2) < 0 ) ? -(var_1_14 - 2) : (var_1_14 - 2)))))))) && (var_1_15 == ((double) ((var_1_16 - var_1_17) - var_1_18)))) && ((var_1_33 >= 0.25) ? (var_1_19 == ((float) (var_1_17 + var_1_20))) : 1)) && ((var_1_26 >= (var_1_26 + (var_1_14 * 16))) ? ((-256 > var_1_24) ? (var_1_21 == ((double) var_1_17)) : 1) : (var_1_21 == ((double) (((((1.75) < (var_1_18)) ? (1.75) : (var_1_18))) - (9.9999999995E9 + var_1_17)))))) && (var_1_27 ? (var_1_23 == ((double) ((((4.5) < 0 ) ? -(4.5) : (4.5))))) : 1)) && (((var_1_13 * (var_1_5 * last_1_var_1_9)) <= var_1_14) ? (var_1_24 == ((signed long int) 50)) : ((last_1_var_1_27 || last_1_var_1_27) ? ((last_1_var_1_27 || last_1_var_1_27) ? (var_1_24 == ((signed long int) last_1_var_1_12)) : 1) : (var_1_24 == ((signed long int) var_1_13))))) && ((0 >= ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6)))) ? (var_1_27 ? (var_1_25 == ((unsigned short int) (((((var_1_5 - var_1_9)) > ((var_1_12 + var_1_24))) ? ((var_1_5 - var_1_9)) : ((var_1_12 + var_1_24)))))) : 1) : ((var_1_8 < 25u) ? (var_1_25 == ((unsigned short int) var_1_6)) : 1))) && ((last_1_var_1_24 >= (128u + last_1_var_1_1)) ? ((10000000 != var_1_14) ? (var_1_26 == ((signed short int) last_1_var_1_25)) : 1) : 1)) && ((50u >= var_1_5) ? (var_1_27 == ((unsigned char) var_1_28)) : 1)) && ((var_1_28 && var_1_27) ? (var_1_29 == ((unsigned char) (var_1_28 && var_1_30))) : ((((((var_1_12) < (var_1_14)) ? (var_1_12) : (var_1_14))) > (-25 << var_1_9)) ? (var_1_29 == ((unsigned char) (var_1_27 || var_1_28))) : (var_1_29 == ((unsigned char) ((var_1_23 <= ((((var_1_21) < (var_1_17)) ? (var_1_21) : (var_1_17)))) && var_1_32))))) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=32767, var_1_6=1073741849, var_1_8=2147483647, var_1_9=1073741798] [L197-L198] return ((((((((((((((last_1_var_1_12 >= last_1_var_1_24) ? (last_1_var_1_29 ? (var_1_1 == ((unsigned short int) (var_1_5 - last_1_var_1_12))) : 1) : 1) && (((var_1_33 * 8.2) < 10.4) ? (var_1_6 == ((unsigned long int) (var_1_8 - var_1_9))) : 1)) && (last_1_var_1_29 ? (last_1_var_1_29 ? (var_1_9 == ((signed long int) (last_1_var_1_24 + 100))) : (var_1_9 == ((signed long int) (((((var_1_5 + last_1_var_1_24)) > (last_1_var_1_9)) ? ((var_1_5 + last_1_var_1_24)) : (last_1_var_1_9)))))) : (var_1_9 == ((signed long int) ((var_1_11 - 16) - last_1_var_1_24))))) && (last_1_var_1_29 ? (var_1_12 == ((unsigned char) (64 + var_1_13))) : (var_1_12 == ((unsigned char) (32 + ((((var_1_14 - 2) < 0 ) ? -(var_1_14 - 2) : (var_1_14 - 2)))))))) && (var_1_15 == ((double) ((var_1_16 - var_1_17) - var_1_18)))) && ((var_1_33 >= 0.25) ? (var_1_19 == ((float) (var_1_17 + var_1_20))) : 1)) && ((var_1_26 >= (var_1_26 + (var_1_14 * 16))) ? ((-256 > var_1_24) ? (var_1_21 == ((double) var_1_17)) : 1) : (var_1_21 == ((double) (((((1.75) < (var_1_18)) ? (1.75) : (var_1_18))) - (9.9999999995E9 + var_1_17)))))) && (var_1_27 ? (var_1_23 == ((double) ((((4.5) < 0 ) ? -(4.5) : (4.5))))) : 1)) && (((var_1_13 * (var_1_5 * last_1_var_1_9)) <= var_1_14) ? (var_1_24 == ((signed long int) 50)) : ((last_1_var_1_27 || last_1_var_1_27) ? ((last_1_var_1_27 || last_1_var_1_27) ? (var_1_24 == ((signed long int) last_1_var_1_12)) : 1) : (var_1_24 == ((signed long int) var_1_13))))) && ((0 >= ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6)))) ? (var_1_27 ? (var_1_25 == ((unsigned short int) (((((var_1_5 - var_1_9)) > ((var_1_12 + var_1_24))) ? ((var_1_5 - var_1_9)) : ((var_1_12 + var_1_24)))))) : 1) : ((var_1_8 < 25u) ? (var_1_25 == ((unsigned short int) var_1_6)) : 1))) && ((last_1_var_1_24 >= (128u + last_1_var_1_1)) ? ((10000000 != var_1_14) ? (var_1_26 == ((signed short int) last_1_var_1_25)) : 1) : 1)) && ((50u >= var_1_5) ? (var_1_27 == ((unsigned char) var_1_28)) : 1)) && ((var_1_28 && var_1_27) ? (var_1_29 == ((unsigned char) (var_1_28 && var_1_30))) : ((((((var_1_12) < (var_1_14)) ? (var_1_12) : (var_1_14))) > (-25 << var_1_9)) ? (var_1_29 == ((unsigned char) (var_1_27 || var_1_28))) : (var_1_29 == ((unsigned char) ((var_1_23 <= ((((var_1_21) < (var_1_17)) ? (var_1_21) : (var_1_17)))) && var_1_32)))))) && ((var_1_32 || (var_1_26 > var_1_1)) ? (var_1_33 == ((float) (((((var_1_20 + ((((var_1_17) > (var_1_34)) ? (var_1_17) : (var_1_34))))) < (var_1_16)) ? ((var_1_20 + ((((var_1_17) > (var_1_34)) ? (var_1_17) : (var_1_34))))) : (var_1_16))))) : (var_1_33 == ((float) var_1_16))) ; [L207] RET, EXPR property() [L207] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=32767, var_1_6=1073741849, var_1_8=2147483647, var_1_9=1073741798] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=5, last_1_var_1_1=64, last_1_var_1_24=8, last_1_var_1_25=32, last_1_var_1_27=0, last_1_var_1_29=0, last_1_var_1_9=-10, var_1_11=1073741822, var_1_12=93, var_1_13=0, var_1_14=63, var_1_16=2, var_1_1=64, var_1_23=61/4, var_1_24=50, var_1_25=32, var_1_26=2, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_32=0, var_1_33=2, var_1_5=32767, var_1_6=1073741849, var_1_8=2147483647, var_1_9=1073741798] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 89 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.0s, OverallIterations: 10, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6488 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6447 mSDsluCounter, 5117 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3803 mSDsCounter, 1656 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3739 IncrementalHoareTripleChecker+Invalid, 5395 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1656 mSolverCounterUnsat, 1314 mSDtfsCounter, 3739 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1661 GetRequests, 1376 SyntacticMatches, 0 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12562 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2264occurred in iteration=8, InterpolantAutomatonStates: 261, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 9 MinimizatonAttempts, 2499 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 2409 NumberOfCodeBlocks, 2409 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 2691 ConstructedInterpolants, 0 QuantifiedInterpolants, 9239 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1934 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 18 InterpolantComputations, 5 PerfectInterpolantSequences, 14483/15120 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 23:58:13,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-66.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 b17426fcbd3c87a5dd89cb5e1501daf40166b5a166256cea7242083b05c82ceb --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:58:15,391 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:58:15,470 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 23:58:15,475 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:58:15,475 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:58:15,490 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:58:15,491 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:58:15,491 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:58:15,491 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:58:15,491 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:58:15,491 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:58:15,491 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:58:15,491 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:58:15,492 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:58:15,492 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:58:15,492 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:58:15,492 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:58:15,492 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:58:15,492 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:58:15,492 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:58:15,492 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:58:15,492 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:58:15,492 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:58:15,492 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 23:58:15,493 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 23:58:15,493 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 23:58:15,493 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:58:15,493 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:58:15,493 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:58:15,493 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:58:15,493 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:58:15,493 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:58:15,493 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:58:15,493 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:58:15,493 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:58:15,493 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:58:15,493 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:58:15,493 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:58:15,493 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:58:15,494 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 23:58:15,494 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 23:58:15,494 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:58:15,494 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:58:15,494 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:58:15,494 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:58:15,494 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> b17426fcbd3c87a5dd89cb5e1501daf40166b5a166256cea7242083b05c82ceb [2025-03-03 23:58:15,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:58:15,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:58:15,701 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:58:15,702 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:58:15,702 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:58:15,703 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-66.i [2025-03-03 23:58:16,907 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50add4158/bbd677cd4bde41cea60e510d649b081b/FLAG152498ebc [2025-03-03 23:58:17,117 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:58:17,117 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-66.i [2025-03-03 23:58:17,127 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50add4158/bbd677cd4bde41cea60e510d649b081b/FLAG152498ebc [2025-03-03 23:58:17,142 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50add4158/bbd677cd4bde41cea60e510d649b081b [2025-03-03 23:58:17,144 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:58:17,145 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:58:17,146 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:58:17,146 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:58:17,149 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:58:17,150 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:58:17" (1/1) ... [2025-03-03 23:58:17,152 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b204350 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:58:17, skipping insertion in model container [2025-03-03 23:58:17,152 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:58:17" (1/1) ... [2025-03-03 23:58:17,171 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:58:17,285 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-66.i[916,929] [2025-03-03 23:58:17,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:58:17,378 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:58:17,386 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-66.i[916,929] [2025-03-03 23:58:17,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:58:17,456 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:58:17,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:58:17 WrapperNode [2025-03-03 23:58:17,458 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:58:17,459 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:58:17,459 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:58:17,459 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:58:17,465 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:58:17" (1/1) ... [2025-03-03 23:58:17,475 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:58:17" (1/1) ... [2025-03-03 23:58:17,508 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 191 [2025-03-03 23:58:17,508 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:58:17,509 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:58:17,509 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:58:17,509 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:58:17,518 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:58:17" (1/1) ... [2025-03-03 23:58:17,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:58:17" (1/1) ... [2025-03-03 23:58:17,521 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:58:17" (1/1) ... [2025-03-03 23:58:17,537 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]. [2025-03-03 23:58:17,538 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:58:17" (1/1) ... [2025-03-03 23:58:17,538 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:58:17" (1/1) ... [2025-03-03 23:58:17,552 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:58:17" (1/1) ... [2025-03-03 23:58:17,553 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:58:17" (1/1) ... [2025-03-03 23:58:17,554 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:58:17" (1/1) ... [2025-03-03 23:58:17,558 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:58:17" (1/1) ... [2025-03-03 23:58:17,560 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:58:17,561 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:58:17,561 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:58:17,561 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:58:17,562 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:58:17" (1/1) ... [2025-03-03 23:58:17,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:58:17,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:58:17,588 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) [2025-03-03 23:58:17,592 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 [2025-03-03 23:58:17,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:58:17,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 23:58:17,609 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:58:17,609 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:58:17,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:58:17,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:58:17,688 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:58:17,690 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:58:33,461 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2025-03-03 23:58:33,461 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:58:33,470 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:58:33,470 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:58:33,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:58:33 BoogieIcfgContainer [2025-03-03 23:58:33,471 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:58:33,473 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:58:33,473 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:58:33,476 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:58:33,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:58:17" (1/3) ... [2025-03-03 23:58:33,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@308b8d5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:58:33, skipping insertion in model container [2025-03-03 23:58:33,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:58:17" (2/3) ... [2025-03-03 23:58:33,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@308b8d5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:58:33, skipping insertion in model container [2025-03-03 23:58:33,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:58:33" (3/3) ... [2025-03-03 23:58:33,478 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-66.i [2025-03-03 23:58:33,492 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:58:33,493 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount100_file-66.i that has 2 procedures, 80 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:58:33,529 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:58:33,538 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;@fc6041c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:58:33,539 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:58:33,542 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 57 states have internal predecessors, (82), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-03 23:58:33,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-03 23:58:33,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:58:33,554 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:58:33,555 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:58:33,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:58:33,571 INFO L85 PathProgramCache]: Analyzing trace with hash 489181185, now seen corresponding path program 1 times [2025-03-03 23:58:33,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:58:33,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1766297864] [2025-03-03 23:58:33,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:58:33,583 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 [2025-03-03 23:58:33,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:58:33,585 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) [2025-03-03 23:58:33,586 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 [2025-03-03 23:58:33,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 23:58:34,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 23:58:34,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:58:34,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:58:34,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:58:34,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:58:34,357 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2025-03-03 23:58:34,359 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:58:34,360 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:58:34,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1766297864] [2025-03-03 23:58:34,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1766297864] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:58:34,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:58:34,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 23:58:34,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146355341] [2025-03-03 23:58:34,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:58:34,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:58:34,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:58:34,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:58:34,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:58:34,385 INFO L87 Difference]: Start difference. First operand has 80 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 57 states have internal predecessors, (82), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 23:58:34,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:58:34,403 INFO L93 Difference]: Finished difference Result 154 states and 264 transitions. [2025-03-03 23:58:34,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:58:34,405 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 147 [2025-03-03 23:58:34,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:58:34,409 INFO L225 Difference]: With dead ends: 154 [2025-03-03 23:58:34,409 INFO L226 Difference]: Without dead ends: 77 [2025-03-03 23:58:34,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:58:34,413 INFO L435 NwaCegarLoop]: 119 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, 119 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 [2025-03-03 23:58:34,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:58:34,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-03 23:58:34,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-03 23:58:34,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 54 states have internal predecessors, (77), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-03 23:58:34,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 119 transitions. [2025-03-03 23:58:34,451 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 119 transitions. Word has length 147 [2025-03-03 23:58:34,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:58:34,451 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 119 transitions. [2025-03-03 23:58:34,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 23:58:34,452 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 119 transitions. [2025-03-03 23:58:34,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-03 23:58:34,456 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:58:34,457 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:58:34,482 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 [2025-03-03 23:58:34,657 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 [2025-03-03 23:58:34,657 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:58:34,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:58:34,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1616987676, now seen corresponding path program 1 times [2025-03-03 23:58:34,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:58:34,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1485717976] [2025-03-03 23:58:34,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:58:34,659 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 [2025-03-03 23:58:34,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:58:34,661 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) [2025-03-03 23:58:34,663 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 [2025-03-03 23:58:34,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 23:58:35,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 23:58:35,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:58:35,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:58:35,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 23:58:35,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:58:38,241 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-03 23:58:38,242 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:58:38,242 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:58:38,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1485717976] [2025-03-03 23:58:38,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1485717976] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:58:38,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:58:38,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 23:58:38,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854148887] [2025-03-03 23:58:38,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:58:38,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 23:58:38,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:58:38,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 23:58:38,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 23:58:38,245 INFO L87 Difference]: Start difference. First operand 77 states and 119 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-03 23:58:42,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:58:46,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:58:51,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:58:55,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:58:55,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:58:55,182 INFO L93 Difference]: Finished difference Result 248 states and 390 transitions. [2025-03-03 23:58:55,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 23:58:55,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 147 [2025-03-03 23:58:55,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:58:55,276 INFO L225 Difference]: With dead ends: 248 [2025-03-03 23:58:55,276 INFO L226 Difference]: Without dead ends: 174 [2025-03-03 23:58:55,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:58:55,277 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 147 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 50 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.8s IncrementalHoareTripleChecker+Time [2025-03-03 23:58:55,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 332 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 15 Invalid, 4 Unknown, 0 Unchecked, 16.8s Time] [2025-03-03 23:58:55,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-03 23:58:55,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 123. [2025-03-03 23:58:55,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 78 states have (on average 1.3333333333333333) internal successors, (104), 78 states have internal predecessors, (104), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-03 23:58:55,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 188 transitions. [2025-03-03 23:58:55,295 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 188 transitions. Word has length 147 [2025-03-03 23:58:55,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:58:55,296 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 188 transitions. [2025-03-03 23:58:55,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-03 23:58:55,296 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 188 transitions. [2025-03-03 23:58:55,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-03 23:58:55,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:58:55,297 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:58:55,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-03 23:58:55,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:58:55,498 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:58:55,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:58:55,498 INFO L85 PathProgramCache]: Analyzing trace with hash 639923331, now seen corresponding path program 1 times [2025-03-03 23:58:55,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:58:55,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [706309249] [2025-03-03 23:58:55,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:58:55,499 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 [2025-03-03 23:58:55,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:58:55,502 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 23:58:55,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-03 23:58:55,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 23:58:56,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 23:58:56,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:58:56,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:58:56,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 23:58:56,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:59:03,379 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 134 proven. 3 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-03 23:59:03,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:59:06,505 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 57 proven. 3 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-03-03 23:59:06,505 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:59:06,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [706309249] [2025-03-03 23:59:06,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [706309249] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:59:06,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 23:59:06,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2025-03-03 23:59:06,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791930045] [2025-03-03 23:59:06,506 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 23:59:06,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 23:59:06,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:59:06,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 23:59:06,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-03 23:59:06,507 INFO L87 Difference]: Start difference. First operand 123 states and 188 transitions. Second operand has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 4 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2025-03-03 23:59:11,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:59:17,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:59:21,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:59:25,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []