./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-61.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-61.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 e18f66b8e050d748e58172ad369a99abf96303f1ce2c22e887e3d1776b423830 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 11:06:38,638 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 11:06:38,707 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 11:06:38,715 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 11:06:38,715 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 11:06:38,744 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 11:06:38,745 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 11:06:38,745 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 11:06:38,746 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 11:06:38,746 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 11:06:38,747 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 11:06:38,747 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 11:06:38,747 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 11:06:38,747 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 11:06:38,747 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 11:06:38,748 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 11:06:38,748 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 11:06:38,748 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 11:06:38,748 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 11:06:38,749 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 11:06:38,749 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 11:06:38,749 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 11:06:38,749 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 11:06:38,749 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 11:06:38,749 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 11:06:38,749 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 11:06:38,749 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 11:06:38,749 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 11:06:38,750 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 11:06:38,750 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:06:38,750 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:06:38,750 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:06:38,750 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:06:38,750 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 11:06:38,751 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:06:38,751 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:06:38,751 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:06:38,751 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:06:38,751 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 11:06:38,752 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 11:06:38,752 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 11:06:38,752 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 11:06:38,752 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 11:06:38,752 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 11:06:38,752 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 11:06:38,752 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 11:06:38,752 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 11:06:38,752 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 11:06:38,752 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-jdk21/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 -> e18f66b8e050d748e58172ad369a99abf96303f1ce2c22e887e3d1776b423830 [2025-01-09 11:06:39,038 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 11:06:39,048 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 11:06:39,050 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 11:06:39,051 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 11:06:39,051 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 11:06:39,053 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-61.i [2025-01-09 11:06:40,420 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/944ab51cd/cc6c982b41494106ba50c8d24dbe3087/FLAG25374b1bc [2025-01-09 11:06:40,705 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 11:06:40,706 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-61.i [2025-01-09 11:06:40,713 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/944ab51cd/cc6c982b41494106ba50c8d24dbe3087/FLAG25374b1bc [2025-01-09 11:06:40,725 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/944ab51cd/cc6c982b41494106ba50c8d24dbe3087 [2025-01-09 11:06:40,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 11:06:40,728 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 11:06:40,729 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 11:06:40,729 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 11:06:40,733 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 11:06:40,734 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:06:40" (1/1) ... [2025-01-09 11:06:40,735 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@708b35f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:40, skipping insertion in model container [2025-01-09 11:06:40,735 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:06:40" (1/1) ... [2025-01-09 11:06:40,755 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 11:06:40,872 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-61.i[919,932] [2025-01-09 11:06:40,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:06:40,935 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 11:06:40,943 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-61.i[919,932] [2025-01-09 11:06:40,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:06:40,985 INFO L204 MainTranslator]: Completed translation [2025-01-09 11:06:40,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:40 WrapperNode [2025-01-09 11:06:40,987 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 11:06:40,988 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 11:06:40,988 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 11:06:40,988 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 11:06:40,993 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:40" (1/1) ... [2025-01-09 11:06:41,008 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:40" (1/1) ... [2025-01-09 11:06:41,048 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 223 [2025-01-09 11:06:41,048 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 11:06:41,049 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 11:06:41,049 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 11:06:41,049 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 11:06:41,057 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:40" (1/1) ... [2025-01-09 11:06:41,057 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:40" (1/1) ... [2025-01-09 11:06:41,060 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:40" (1/1) ... [2025-01-09 11:06:41,085 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-01-09 11:06:41,085 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:40" (1/1) ... [2025-01-09 11:06:41,085 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:40" (1/1) ... [2025-01-09 11:06:41,096 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:40" (1/1) ... [2025-01-09 11:06:41,098 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:40" (1/1) ... [2025-01-09 11:06:41,106 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:40" (1/1) ... [2025-01-09 11:06:41,108 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:40" (1/1) ... [2025-01-09 11:06:41,112 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:40" (1/1) ... [2025-01-09 11:06:41,119 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 11:06:41,120 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 11:06:41,120 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 11:06:41,123 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 11:06:41,124 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:40" (1/1) ... [2025-01-09 11:06:41,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:06:41,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:06:41,152 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 11:06:41,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 11:06:41,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 11:06:41,174 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 11:06:41,174 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 11:06:41,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 11:06:41,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 11:06:41,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 11:06:41,264 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 11:06:41,265 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 11:06:41,694 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-01-09 11:06:41,694 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 11:06:41,704 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 11:06:41,705 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 11:06:41,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:06:41 BoogieIcfgContainer [2025-01-09 11:06:41,705 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 11:06:41,707 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 11:06:41,707 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 11:06:41,711 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 11:06:41,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:06:40" (1/3) ... [2025-01-09 11:06:41,713 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f215f44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:06:41, skipping insertion in model container [2025-01-09 11:06:41,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:40" (2/3) ... [2025-01-09 11:06:41,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f215f44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:06:41, skipping insertion in model container [2025-01-09 11:06:41,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:06:41" (3/3) ... [2025-01-09 11:06:41,715 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-61.i [2025-01-09 11:06:41,729 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 11:06:41,731 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-61.i that has 2 procedures, 102 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 11:06:41,788 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 11:06:41,797 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;@6544b996, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 11:06:41,797 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 11:06:41,803 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 75 states have (on average 1.4933333333333334) internal successors, (112), 76 states have internal predecessors, (112), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 11:06:41,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 11:06:41,819 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:06:41,819 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 11:06:41,820 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:06:41,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:06:41,825 INFO L85 PathProgramCache]: Analyzing trace with hash 574821497, now seen corresponding path program 1 times [2025-01-09 11:06:41,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:06:41,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647555799] [2025-01-09 11:06:41,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:06:41,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:06:41,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 11:06:41,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 11:06:41,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:06:41,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:06:42,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-01-09 11:06:42,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:06:42,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647555799] [2025-01-09 11:06:42,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647555799] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:06:42,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262249833] [2025-01-09 11:06:42,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:06:42,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:06:42,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:06:42,171 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 11:06:42,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 11:06:42,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 11:06:42,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 11:06:42,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:06:42,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:06:42,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 11:06:42,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:06:42,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-01-09 11:06:42,437 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:06:42,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262249833] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:06:42,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 11:06:42,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 11:06:42,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193850228] [2025-01-09 11:06:42,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:06:42,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 11:06:42,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:06:42,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 11:06:42,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:06:42,466 INFO L87 Difference]: Start difference. First operand has 102 states, 75 states have (on average 1.4933333333333334) internal successors, (112), 76 states have internal predecessors, (112), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 11:06:42,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:06:42,499 INFO L93 Difference]: Finished difference Result 198 states and 339 transitions. [2025-01-09 11:06:42,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 11:06:42,502 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 166 [2025-01-09 11:06:42,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:06:42,510 INFO L225 Difference]: With dead ends: 198 [2025-01-09 11:06:42,510 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 11:06:42,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 167 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-01-09 11:06:42,520 INFO L435 NwaCegarLoop]: 153 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, 153 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-01-09 11:06:42,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:06:42,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 11:06:42,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-01-09 11:06:42,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 73 states have internal predecessors, (105), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 11:06:42,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 153 transitions. [2025-01-09 11:06:42,562 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 153 transitions. Word has length 166 [2025-01-09 11:06:42,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:06:42,562 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 153 transitions. [2025-01-09 11:06:42,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 11:06:42,563 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 153 transitions. [2025-01-09 11:06:42,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 11:06:42,567 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:06:42,567 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 11:06:42,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 11:06:42,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 11:06:42,768 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:06:42,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:06:42,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1393835069, now seen corresponding path program 1 times [2025-01-09 11:06:42,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:06:42,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3023256] [2025-01-09 11:06:42,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:06:42,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:06:42,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 11:06:42,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 11:06:42,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:06:42,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:06:43,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 11:06:43,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:06:43,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3023256] [2025-01-09 11:06:43,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3023256] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:06:43,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:06:43,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:06:43,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894901569] [2025-01-09 11:06:43,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:06:43,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:06:43,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:06:43,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:06:43,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:06:43,169 INFO L87 Difference]: Start difference. First operand 99 states and 153 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 11:06:43,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:06:43,205 INFO L93 Difference]: Finished difference Result 195 states and 303 transitions. [2025-01-09 11:06:43,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:06:43,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 166 [2025-01-09 11:06:43,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:06:43,212 INFO L225 Difference]: With dead ends: 195 [2025-01-09 11:06:43,212 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 11:06:43,213 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-01-09 11:06:43,214 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:06:43,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 298 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:06:43,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 11:06:43,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-01-09 11:06:43,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 73 states have (on average 1.4246575342465753) internal successors, (104), 73 states have internal predecessors, (104), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 11:06:43,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 152 transitions. [2025-01-09 11:06:43,237 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 152 transitions. Word has length 166 [2025-01-09 11:06:43,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:06:43,239 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 152 transitions. [2025-01-09 11:06:43,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 11:06:43,239 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 152 transitions. [2025-01-09 11:06:43,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 11:06:43,243 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:06:43,243 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 11:06:43,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 11:06:43,243 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:06:43,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:06:43,244 INFO L85 PathProgramCache]: Analyzing trace with hash 884361979, now seen corresponding path program 1 times [2025-01-09 11:06:43,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:06:43,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677005018] [2025-01-09 11:06:43,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:06:43,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:06:43,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 11:06:43,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 11:06:43,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:06:43,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:06:43,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 11:06:43,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:06:43,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677005018] [2025-01-09 11:06:43,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677005018] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:06:43,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:06:43,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:06:43,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067078302] [2025-01-09 11:06:43,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:06:43,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:06:43,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:06:43,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:06:43,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:06:43,878 INFO L87 Difference]: Start difference. First operand 99 states and 152 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 11:06:44,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:06:44,168 INFO L93 Difference]: Finished difference Result 288 states and 445 transitions. [2025-01-09 11:06:44,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 11:06:44,169 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 166 [2025-01-09 11:06:44,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:06:44,172 INFO L225 Difference]: With dead ends: 288 [2025-01-09 11:06:44,172 INFO L226 Difference]: Without dead ends: 192 [2025-01-09 11:06:44,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:06:44,175 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 252 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:06:44,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 330 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 11:06:44,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-01-09 11:06:44,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 137. [2025-01-09 11:06:44,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 111 states have (on average 1.4954954954954955) internal successors, (166), 111 states have internal predecessors, (166), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 11:06:44,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 214 transitions. [2025-01-09 11:06:44,219 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 214 transitions. Word has length 166 [2025-01-09 11:06:44,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:06:44,221 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 214 transitions. [2025-01-09 11:06:44,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 11:06:44,221 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 214 transitions. [2025-01-09 11:06:44,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 11:06:44,225 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:06:44,225 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 11:06:44,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 11:06:44,226 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:06:44,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:06:44,227 INFO L85 PathProgramCache]: Analyzing trace with hash 750348473, now seen corresponding path program 1 times [2025-01-09 11:06:44,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:06:44,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30729860] [2025-01-09 11:06:44,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:06:44,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:06:44,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 11:06:44,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 11:06:44,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:06:44,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:06:44,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 11:06:44,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:06:44,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30729860] [2025-01-09 11:06:44,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30729860] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:06:44,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:06:44,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:06:44,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247544059] [2025-01-09 11:06:44,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:06:44,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:06:44,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:06:44,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:06:44,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:06:44,571 INFO L87 Difference]: Start difference. First operand 137 states and 214 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 11:06:44,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:06:44,804 INFO L93 Difference]: Finished difference Result 326 states and 503 transitions. [2025-01-09 11:06:44,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 11:06:44,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 166 [2025-01-09 11:06:44,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:06:44,807 INFO L225 Difference]: With dead ends: 326 [2025-01-09 11:06:44,807 INFO L226 Difference]: Without dead ends: 192 [2025-01-09 11:06:44,808 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-01-09 11:06:44,809 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 127 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:06:44,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 422 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 11:06:44,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-01-09 11:06:44,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 137. [2025-01-09 11:06:44,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 111 states have (on average 1.4864864864864864) internal successors, (165), 111 states have internal predecessors, (165), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 11:06:44,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 213 transitions. [2025-01-09 11:06:44,858 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 213 transitions. Word has length 166 [2025-01-09 11:06:44,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:06:44,858 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 213 transitions. [2025-01-09 11:06:44,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 11:06:44,859 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 213 transitions. [2025-01-09 11:06:44,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 11:06:44,864 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:06:44,864 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 11:06:44,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 11:06:44,864 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:06:44,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:06:44,865 INFO L85 PathProgramCache]: Analyzing trace with hash -757438695, now seen corresponding path program 1 times [2025-01-09 11:06:44,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:06:44,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716135991] [2025-01-09 11:06:44,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:06:44,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:06:44,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 11:06:44,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 11:06:44,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:06:44,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 11:06:44,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1609555566] [2025-01-09 11:06:44,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:06:44,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:06:44,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:06:44,990 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 11:06:44,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 11:06:45,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 11:06:45,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 11:06:45,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:06:45,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:06:45,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 11:06:45,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:06:45,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 11:06:45,963 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:06:45,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:06:45,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716135991] [2025-01-09 11:06:45,965 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 11:06:45,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609555566] [2025-01-09 11:06:45,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609555566] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:06:45,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:06:45,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 11:06:45,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912659594] [2025-01-09 11:06:45,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:06:45,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:06:45,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:06:45,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:06:45,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:06:45,968 INFO L87 Difference]: Start difference. First operand 137 states and 213 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 11:06:46,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:06:46,096 INFO L93 Difference]: Finished difference Result 405 states and 633 transitions. [2025-01-09 11:06:46,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:06:46,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 168 [2025-01-09 11:06:46,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:06:46,100 INFO L225 Difference]: With dead ends: 405 [2025-01-09 11:06:46,100 INFO L226 Difference]: Without dead ends: 271 [2025-01-09 11:06:46,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 166 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-01-09 11:06:46,104 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 73 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:06:46,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 315 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 11:06:46,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-01-09 11:06:46,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 269. [2025-01-09 11:06:46,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 218 states have (on average 1.4862385321100917) internal successors, (324), 218 states have internal predecessors, (324), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 11:06:46,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 420 transitions. [2025-01-09 11:06:46,167 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 420 transitions. Word has length 168 [2025-01-09 11:06:46,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:06:46,168 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 420 transitions. [2025-01-09 11:06:46,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 11:06:46,169 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 420 transitions. [2025-01-09 11:06:46,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 11:06:46,170 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:06:46,171 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 11:06:46,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 11:06:46,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:06:46,371 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:06:46,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:06:46,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1047999639, now seen corresponding path program 1 times [2025-01-09 11:06:46,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:06:46,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609505331] [2025-01-09 11:06:46,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:06:46,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:06:46,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 11:06:46,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 11:06:46,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:06:46,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:06:46,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 11:06:46,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:06:46,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609505331] [2025-01-09 11:06:46,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609505331] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:06:46,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:06:46,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:06:46,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505260250] [2025-01-09 11:06:46,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:06:46,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:06:46,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:06:46,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:06:46,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:06:46,670 INFO L87 Difference]: Start difference. First operand 269 states and 420 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 11:06:46,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:06:46,816 INFO L93 Difference]: Finished difference Result 271 states and 421 transitions. [2025-01-09 11:06:46,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 11:06:46,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 168 [2025-01-09 11:06:46,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:06:46,819 INFO L225 Difference]: With dead ends: 271 [2025-01-09 11:06:46,819 INFO L226 Difference]: Without dead ends: 137 [2025-01-09 11:06:46,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:06:46,820 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 101 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:06:46,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 237 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 11:06:46,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-01-09 11:06:46,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2025-01-09 11:06:46,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 111 states have (on average 1.4504504504504505) internal successors, (161), 111 states have internal predecessors, (161), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 11:06:46,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 209 transitions. [2025-01-09 11:06:46,842 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 209 transitions. Word has length 168 [2025-01-09 11:06:46,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:06:46,842 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 209 transitions. [2025-01-09 11:06:46,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 11:06:46,843 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 209 transitions. [2025-01-09 11:06:46,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-01-09 11:06:46,846 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:06:46,846 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 11:06:46,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 11:06:46,847 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:06:46,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:06:46,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1290863690, now seen corresponding path program 1 times [2025-01-09 11:06:46,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:06:46,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610337691] [2025-01-09 11:06:46,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:06:46,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:06:46,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 11:06:46,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 11:06:46,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:06:46,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 11:06:46,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1298165067] [2025-01-09 11:06:46,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:06:46,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:06:46,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:06:46,954 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 11:06:46,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 11:06:47,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 11:06:47,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 11:06:47,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:06:47,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:06:47,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 11:06:47,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:06:48,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 473 proven. 30 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2025-01-09 11:06:48,426 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:06:51,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:06:51,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610337691] [2025-01-09 11:06:51,255 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 11:06:51,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298165067] [2025-01-09 11:06:51,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298165067] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:06:51,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-09 11:06:51,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2025-01-09 11:06:51,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283778265] [2025-01-09 11:06:51,255 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-09 11:06:51,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 11:06:51,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:06:51,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 11:06:51,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-01-09 11:06:51,258 INFO L87 Difference]: Start difference. First operand 137 states and 209 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 3 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-01-09 11:06:52,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:06:52,349 INFO L93 Difference]: Finished difference Result 287 states and 426 transitions. [2025-01-09 11:06:52,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 11:06:52,352 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 3 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 169 [2025-01-09 11:06:52,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:06:52,354 INFO L225 Difference]: With dead ends: 287 [2025-01-09 11:06:52,354 INFO L226 Difference]: Without dead ends: 153 [2025-01-09 11:06:52,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2025-01-09 11:06:52,355 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 232 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 11:06:52,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 413 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 11:06:52,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-01-09 11:06:52,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 147. [2025-01-09 11:06:52,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 118 states have (on average 1.3898305084745763) internal successors, (164), 118 states have internal predecessors, (164), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 11:06:52,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 212 transitions. [2025-01-09 11:06:52,377 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 212 transitions. Word has length 169 [2025-01-09 11:06:52,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:06:52,378 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 212 transitions. [2025-01-09 11:06:52,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 3 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-01-09 11:06:52,378 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 212 transitions. [2025-01-09 11:06:52,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-01-09 11:06:52,382 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:06:52,382 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 11:06:52,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 11:06:52,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:06:52,583 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:06:52,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:06:52,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1855978166, now seen corresponding path program 1 times [2025-01-09 11:06:52,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:06:52,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392001909] [2025-01-09 11:06:52,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:06:52,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:06:52,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 11:06:52,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 11:06:52,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:06:52,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 11:06:52,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [923894320] [2025-01-09 11:06:52,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:06:52,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:06:52,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:06:52,683 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 11:06:52,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 11:06:52,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 11:06:52,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 11:06:52,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:06:52,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 11:06:52,802 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 11:06:52,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 11:06:52,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 11:06:52,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:06:52,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 11:06:52,978 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 11:06:52,978 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 11:06:52,979 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 11:06:52,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 11:06:53,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-01-09 11:06:53,185 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:06:53,305 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 11:06:53,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 11:06:53 BoogieIcfgContainer [2025-01-09 11:06:53,311 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 11:06:53,311 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 11:06:53,311 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 11:06:53,312 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 11:06:53,312 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:06:41" (3/4) ... [2025-01-09 11:06:53,314 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 11:06:53,315 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 11:06:53,316 INFO L158 Benchmark]: Toolchain (without parser) took 12587.66ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 103.8MB in the beginning and 154.4MB in the end (delta: -50.6MB). Peak memory consumption was 214.9MB. Max. memory is 16.1GB. [2025-01-09 11:06:53,316 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 11:06:53,316 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.64ms. Allocated memory is still 142.6MB. Free memory was 103.8MB in the beginning and 89.0MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 11:06:53,316 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.39ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 86.3MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 11:06:53,317 INFO L158 Benchmark]: Boogie Preprocessor took 69.87ms. Allocated memory is still 142.6MB. Free memory was 86.3MB in the beginning and 82.4MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 11:06:53,317 INFO L158 Benchmark]: RCFGBuilder took 585.64ms. Allocated memory is still 142.6MB. Free memory was 82.4MB in the beginning and 57.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 11:06:53,317 INFO L158 Benchmark]: TraceAbstraction took 11603.52ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 56.3MB in the beginning and 154.5MB in the end (delta: -98.2MB). Peak memory consumption was 156.2MB. Max. memory is 16.1GB. [2025-01-09 11:06:53,317 INFO L158 Benchmark]: Witness Printer took 3.70ms. Allocated memory is still 402.7MB. Free memory was 154.5MB in the beginning and 154.4MB in the end (delta: 120.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 11:06:53,318 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 258.64ms. Allocated memory is still 142.6MB. Free memory was 103.8MB in the beginning and 89.0MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.39ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 86.3MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 69.87ms. Allocated memory is still 142.6MB. Free memory was 86.3MB in the beginning and 82.4MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 585.64ms. Allocated memory is still 142.6MB. Free memory was 82.4MB in the beginning and 57.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 11603.52ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 56.3MB in the beginning and 154.5MB in the end (delta: -98.2MB). Peak memory consumption was 156.2MB. Max. memory is 16.1GB. * Witness Printer took 3.70ms. Allocated memory is still 402.7MB. Free memory was 154.5MB in the beginning and 154.4MB in the end (delta: 120.0kB). Peak memory consumption was 8.4MB. 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 someBinaryArithmeticDOUBLEoperation at line 122, overapproximation of someBinaryFLOATComparisonOperation at line 150, overapproximation of someBinaryFLOATComparisonOperation at line 61, overapproximation of someBinaryFLOATComparisonOperation at line 185, overapproximation of someBinaryDOUBLEComparisonOperation at line 176, overapproximation of someBinaryDOUBLEComparisonOperation at line 124, overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 174, overapproximation of someBinaryDOUBLEComparisonOperation at line 185, overapproximation of someBinaryDOUBLEComparisonOperation at line 60, overapproximation of someUnaryFLOAToperation at line 61. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 8.5; [L23] unsigned long int var_1_4 = 1; [L24] unsigned long int var_1_5 = 50; [L25] unsigned long int var_1_6 = 4; [L26] float var_1_7 = 15.8; [L27] float var_1_8 = 64.25; [L28] signed long int var_1_9 = -50; [L29] unsigned char var_1_13 = 1; [L30] unsigned long int var_1_14 = 3207304078; [L31] unsigned long int var_1_15 = 50; [L32] unsigned long int var_1_16 = 25; [L33] unsigned char var_1_17 = 1; [L34] unsigned char var_1_18 = 0; [L35] unsigned char var_1_19 = 0; [L36] unsigned short int var_1_20 = 1; [L37] unsigned long int var_1_21 = 50; [L38] signed char var_1_22 = -4; [L39] signed char var_1_23 = -10; [L40] unsigned long int var_1_24 = 2; [L41] unsigned long int var_1_26 = 1; [L42] double var_1_33 = 1.5; [L43] double var_1_35 = 50.5; [L44] double var_1_36 = 1.9; [L45] unsigned long int var_1_37 = 10000; [L46] unsigned char var_1_38 = 1; [L47] unsigned char var_1_39 = 0; [L48] double var_1_40 = 15.5; [L49] unsigned long int var_1_42 = 128; [L50] signed char var_1_43 = -1; [L51] signed long int last_1_var_1_9 = -50; VAL [isInitial=0, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L189] isInitial = 1 [L190] FCALL initially() [L192] CALL updateLastVariables() [L182] last_1_var_1_9 = var_1_9 VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L192] RET updateLastVariables() [L193] CALL updateVariables() [L143] var_1_5 = __VERIFIER_nondet_ulong() [L144] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L144] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L145] CALL assume_abort_if_not(var_1_5 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L145] RET assume_abort_if_not(var_1_5 <= 4294967294) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L146] var_1_6 = __VERIFIER_nondet_ulong() [L147] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L147] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L148] CALL assume_abort_if_not(var_1_6 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L148] RET assume_abort_if_not(var_1_6 <= 4294967294) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L149] var_1_8 = __VERIFIER_nondet_float() [L150] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L150] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L151] var_1_14 = __VERIFIER_nondet_ulong() [L152] CALL assume_abort_if_not(var_1_14 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L152] RET assume_abort_if_not(var_1_14 >= 2147483647) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L153] CALL assume_abort_if_not(var_1_14 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L153] RET assume_abort_if_not(var_1_14 <= 4294967295) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L154] var_1_15 = __VERIFIER_nondet_ulong() [L155] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L155] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L156] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L156] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L157] var_1_16 = __VERIFIER_nondet_ulong() [L158] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L158] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L159] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L159] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L160] var_1_17 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L161] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L162] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L162] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L163] var_1_18 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_18 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L164] RET assume_abort_if_not(var_1_18 >= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L165] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L165] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L166] var_1_20 = __VERIFIER_nondet_ushort() [L167] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L167] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L168] CALL assume_abort_if_not(var_1_20 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L168] RET assume_abort_if_not(var_1_20 <= 65535) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L169] CALL assume_abort_if_not(var_1_20 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L169] RET assume_abort_if_not(var_1_20 != 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L170] var_1_23 = __VERIFIER_nondet_char() [L171] CALL assume_abort_if_not(var_1_23 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L171] RET assume_abort_if_not(var_1_23 >= -127) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L172] CALL assume_abort_if_not(var_1_23 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L172] RET assume_abort_if_not(var_1_23 <= 126) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L173] var_1_35 = __VERIFIER_nondet_double() [L174] CALL assume_abort_if_not((var_1_35 >= 0.0F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854765600e+12F && var_1_35 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L174] RET assume_abort_if_not((var_1_35 >= 0.0F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854765600e+12F && var_1_35 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L175] var_1_36 = __VERIFIER_nondet_double() [L176] CALL assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L176] RET assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L177] var_1_39 = __VERIFIER_nondet_uchar() [L178] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L178] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L179] CALL assume_abort_if_not(var_1_39 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L179] RET assume_abort_if_not(var_1_39 <= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L193] RET updateVariables() [L194] CALL step() [L55] signed long int stepLocal_0 = last_1_var_1_9; VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_0=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L56] COND FALSE !(stepLocal_0 < last_1_var_1_9) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L59] var_1_21 = var_1_6 VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L60] COND TRUE (var_1_35 <= 64.5) && var_1_18 [L61] var_1_40 = ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_8=3, var_1_9=-50] [L65] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_8=3, var_1_9=-50] [L66] COND FALSE !((var_1_21 / ((((64u) < 0 ) ? -(64u) : (64u)))) == var_1_4) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_8=3, var_1_9=-50] [L69] COND TRUE \read(var_1_17) [L70] var_1_43 = ((((((((-16) < 0 ) ? -(-16) : (-16)))) > (var_1_23)) ? (((((-16) < 0 ) ? -(-16) : (-16)))) : (var_1_23))) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=17, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_8=3, var_1_9=-50] [L72] unsigned long int stepLocal_4 = 4256310412u - 128u; VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_4=4256310284, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=17, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_8=3, var_1_9=-50] [L73] COND FALSE !(var_1_4 >= stepLocal_4) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=17, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_8=3, var_1_9=-50] [L76] COND TRUE var_1_20 < ((var_1_4 + 16u) * var_1_9) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=17, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_8=3, var_1_9=-50] [L77] COND FALSE !(var_1_18 && (var_1_35 < var_1_36)) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=17, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_8=3, var_1_9=-50] [L85] COND TRUE var_1_16 < var_1_9 [L86] var_1_42 = ((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=0, var_1_43=17, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_8=3, var_1_9=-50] [L88] signed long int stepLocal_3 = var_1_9; [L89] unsigned long int stepLocal_2 = (((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)); VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_2=-2147483649, stepLocal_3=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=0, var_1_43=17, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_8=3, var_1_9=-50] [L90] EXPR var_1_21 ^ 4u VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_2=-2147483649, stepLocal_3=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=0, var_1_43=17, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=79/5, var_1_8=3, var_1_9=-50] [L90] unsigned long int stepLocal_1 = var_1_21 ^ 4u; [L91] COND FALSE !(var_1_9 <= stepLocal_2) [L100] var_1_7 = var_1_8 VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=0, var_1_43=17, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=3, var_1_8=3, var_1_9=-50] [L102] var_1_24 = var_1_5 VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=-2147483649, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=0, var_1_43=17, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=3, var_1_8=3, var_1_9=-50] [L103] COND FALSE !(var_1_5 != var_1_14) [L110] var_1_26 = 16u VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=-2147483649, var_1_26=16, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=0, var_1_43=17, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=3, var_1_8=3, var_1_9=-50] [L112] COND FALSE !(var_1_21 >= (var_1_14 - ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) [L119] var_1_13 = var_1_18 VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=-2147483649, var_1_26=16, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=0, var_1_43=17, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=3, var_1_8=3, var_1_9=-50] [L121] COND TRUE \read(var_1_13) [L122] var_1_33 = (var_1_35 - var_1_36) VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=-2147483649, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=0, var_1_43=17, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=3, var_1_8=3, var_1_9=-50] [L124] COND FALSE !(var_1_35 >= var_1_8) VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=-2147483649, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=0, var_1_43=17, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=3, var_1_8=3, var_1_9=-50] [L129] signed long int stepLocal_5 = (var_1_22 / 2) / var_1_20; VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, stepLocal_5=8, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=-2147483649, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=0, var_1_43=17, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=3, var_1_8=3, var_1_9=-50] [L130] COND TRUE stepLocal_5 >= (~ 100) VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=-2147483649, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=0, var_1_43=17, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=3, var_1_8=3, var_1_9=-50] [L131] COND TRUE \read(var_1_13) [L132] var_1_19 = (var_1_17 && var_1_18) VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=-2147483649, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=0, var_1_43=17, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=3, var_1_8=3, var_1_9=-50] [L194] RET step() [L195] CALL, EXPR property() [L185] EXPR ((((var_1_21 / ((((64u) < 0 ) ? -(64u) : (64u)))) == var_1_4) ? (var_1_1 == ((double) (8.8 - 255.2))) : 1) && ((last_1_var_1_9 < last_1_var_1_9) ? (var_1_4 == ((unsigned long int) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : 1)) && ((var_1_9 <= ((((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)))) ? ((var_1_9 < var_1_5) ? ((var_1_9 >= (var_1_21 ^ 4u)) ? (var_1_7 == ((float) var_1_8)) : 1) : (var_1_7 == ((float) var_1_8))) : (var_1_7 == ((float) var_1_8))) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=-2147483649, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=0, var_1_43=17, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=3, var_1_8=3, var_1_9=-50] [L185] EXPR (var_1_9 <= ((((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)))) ? ((var_1_9 < var_1_5) ? ((var_1_9 >= (var_1_21 ^ 4u)) ? (var_1_7 == ((float) var_1_8)) : 1) : (var_1_7 == ((float) var_1_8))) : (var_1_7 == ((float) var_1_8)) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=-2147483649, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=0, var_1_43=17, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=3, var_1_8=3, var_1_9=-50] [L185] EXPR ((((var_1_21 / ((((64u) < 0 ) ? -(64u) : (64u)))) == var_1_4) ? (var_1_1 == ((double) (8.8 - 255.2))) : 1) && ((last_1_var_1_9 < last_1_var_1_9) ? (var_1_4 == ((unsigned long int) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : 1)) && ((var_1_9 <= ((((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)))) ? ((var_1_9 < var_1_5) ? ((var_1_9 >= (var_1_21 ^ 4u)) ? (var_1_7 == ((float) var_1_8)) : 1) : (var_1_7 == ((float) var_1_8))) : (var_1_7 == ((float) var_1_8))) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=-2147483649, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=0, var_1_43=17, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=3, var_1_8=3, var_1_9=-50] [L185-L186] return (((((((((var_1_21 / ((((64u) < 0 ) ? -(64u) : (64u)))) == var_1_4) ? (var_1_1 == ((double) (8.8 - 255.2))) : 1) && ((last_1_var_1_9 < last_1_var_1_9) ? (var_1_4 == ((unsigned long int) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : 1)) && ((var_1_9 <= ((((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)))) ? ((var_1_9 < var_1_5) ? ((var_1_9 >= (var_1_21 ^ 4u)) ? (var_1_7 == ((float) var_1_8)) : 1) : (var_1_7 == ((float) var_1_8))) : (var_1_7 == ((float) var_1_8)))) && ((var_1_4 >= (4256310412u - 128u)) ? (var_1_9 == ((signed long int) (((((var_1_22 + var_1_22) < 0 ) ? -(var_1_22 + var_1_22) : (var_1_22 + var_1_22))) + var_1_22))) : 1)) && ((var_1_21 >= (var_1_14 - ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) ? ((var_1_16 < var_1_9) ? (var_1_13 == ((unsigned char) var_1_17)) : (var_1_13 == ((unsigned char) var_1_17))) : (var_1_13 == ((unsigned char) var_1_18)))) && ((((var_1_22 / 2) / var_1_20) >= (~ 100)) ? (var_1_13 ? (var_1_19 == ((unsigned char) (var_1_17 && var_1_18))) : 1) : (var_1_17 ? (var_1_19 == ((unsigned char) var_1_18)) : (var_1_19 == ((unsigned char) var_1_18))))) && (var_1_21 == ((unsigned long int) var_1_6))) && (var_1_22 == ((signed char) var_1_23)) ; [L195] RET, EXPR property() [L195] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=-2147483649, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=0, var_1_43=17, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=3, var_1_8=3, var_1_9=-50] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=-2147483649, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=0, var_1_43=17, var_1_4=1, var_1_5=-2147483649, var_1_6=0, var_1_7=3, var_1_8=3, var_1_9=-50] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 102 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.4s, OverallIterations: 8, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 785 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 785 mSDsluCounter, 2168 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1016 mSDsCounter, 111 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 485 IncrementalHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 111 mSolverCounterUnsat, 1152 mSDtfsCounter, 485 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 565 GetRequests, 535 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=269occurred in iteration=5, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 118 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 2010 NumberOfCodeBlocks, 2010 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1327 ConstructedInterpolants, 1 QuantifiedInterpolants, 3870 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1167 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 8756/8832 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-01-09 11:06:53,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-61.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 e18f66b8e050d748e58172ad369a99abf96303f1ce2c22e887e3d1776b423830 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 11:06:55,657 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 11:06:55,762 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 11:06:55,772 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 11:06:55,773 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 11:06:55,805 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 11:06:55,805 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 11:06:55,805 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 11:06:55,806 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 11:06:55,806 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 11:06:55,806 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 11:06:55,806 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 11:06:55,806 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 11:06:55,806 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 11:06:55,806 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 11:06:55,806 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 11:06:55,807 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 11:06:55,807 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 11:06:55,807 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 11:06:55,807 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 11:06:55,807 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 11:06:55,807 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 11:06:55,807 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 11:06:55,807 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 11:06:55,807 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 11:06:55,807 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 11:06:55,807 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 11:06:55,811 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 11:06:55,811 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 11:06:55,811 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 11:06:55,811 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 11:06:55,811 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:06:55,811 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:06:55,812 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:06:55,812 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:06:55,812 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 11:06:55,812 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:06:55,812 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:06:55,812 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:06:55,812 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:06:55,812 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 11:06:55,812 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 11:06:55,812 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 11:06:55,812 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 11:06:55,812 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 11:06:55,812 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 11:06:55,812 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 11:06:55,812 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 11:06:55,813 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 11:06:55,813 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 11:06:55,813 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-jdk21/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 -> e18f66b8e050d748e58172ad369a99abf96303f1ce2c22e887e3d1776b423830 [2025-01-09 11:06:56,106 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 11:06:56,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 11:06:56,113 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 11:06:56,114 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 11:06:56,114 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 11:06:56,117 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-61.i [2025-01-09 11:06:57,497 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c2deaa577/81afb1346f2e40859c9c60200e138f14/FLAG482b38b44 [2025-01-09 11:06:57,722 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 11:06:57,722 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-61.i [2025-01-09 11:06:57,733 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c2deaa577/81afb1346f2e40859c9c60200e138f14/FLAG482b38b44 [2025-01-09 11:06:57,751 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c2deaa577/81afb1346f2e40859c9c60200e138f14 [2025-01-09 11:06:57,754 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 11:06:57,755 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 11:06:57,756 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 11:06:57,756 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 11:06:57,760 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 11:06:57,761 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:06:57" (1/1) ... [2025-01-09 11:06:57,763 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@685d197c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:57, skipping insertion in model container [2025-01-09 11:06:57,763 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:06:57" (1/1) ... [2025-01-09 11:06:57,781 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 11:06:57,913 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-61.i[919,932] [2025-01-09 11:06:57,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:06:58,000 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 11:06:58,011 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-61.i[919,932] [2025-01-09 11:06:58,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:06:58,055 INFO L204 MainTranslator]: Completed translation [2025-01-09 11:06:58,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:58 WrapperNode [2025-01-09 11:06:58,056 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 11:06:58,057 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 11:06:58,057 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 11:06:58,058 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 11:06:58,063 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:58" (1/1) ... [2025-01-09 11:06:58,072 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:58" (1/1) ... [2025-01-09 11:06:58,103 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 179 [2025-01-09 11:06:58,103 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 11:06:58,108 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 11:06:58,108 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 11:06:58,108 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 11:06:58,123 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:58" (1/1) ... [2025-01-09 11:06:58,123 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:58" (1/1) ... [2025-01-09 11:06:58,128 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:58" (1/1) ... [2025-01-09 11:06:58,146 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-01-09 11:06:58,146 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:58" (1/1) ... [2025-01-09 11:06:58,146 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:58" (1/1) ... [2025-01-09 11:06:58,155 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:58" (1/1) ... [2025-01-09 11:06:58,157 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:58" (1/1) ... [2025-01-09 11:06:58,160 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:58" (1/1) ... [2025-01-09 11:06:58,162 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:58" (1/1) ... [2025-01-09 11:06:58,163 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:58" (1/1) ... [2025-01-09 11:06:58,166 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 11:06:58,167 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 11:06:58,167 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 11:06:58,167 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 11:06:58,168 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:58" (1/1) ... [2025-01-09 11:06:58,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:06:58,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:06:58,195 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 11:06:58,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 11:06:58,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 11:06:58,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 11:06:58,223 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 11:06:58,223 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 11:06:58,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 11:06:58,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 11:06:58,288 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 11:06:58,289 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 11:06:59,081 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-01-09 11:06:59,082 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 11:06:59,097 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 11:06:59,097 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 11:06:59,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:06:59 BoogieIcfgContainer [2025-01-09 11:06:59,098 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 11:06:59,100 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 11:06:59,100 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 11:06:59,105 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 11:06:59,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:06:57" (1/3) ... [2025-01-09 11:06:59,106 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@453368ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:06:59, skipping insertion in model container [2025-01-09 11:06:59,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:58" (2/3) ... [2025-01-09 11:06:59,108 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@453368ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:06:59, skipping insertion in model container [2025-01-09 11:06:59,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:06:59" (3/3) ... [2025-01-09 11:06:59,110 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-61.i [2025-01-09 11:06:59,123 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 11:06:59,124 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-61.i that has 2 procedures, 84 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 11:06:59,172 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 11:06:59,182 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;@23b5f076, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 11:06:59,182 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 11:06:59,185 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 58 states have internal predecessors, (84), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 11:06:59,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 11:06:59,200 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:06:59,201 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 11:06:59,202 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:06:59,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:06:59,207 INFO L85 PathProgramCache]: Analyzing trace with hash 872694412, now seen corresponding path program 1 times [2025-01-09 11:06:59,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:06:59,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [920715414] [2025-01-09 11:06:59,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:06:59,217 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-01-09 11:06:59,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:06:59,220 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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-01-09 11:06:59,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 11:06:59,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 11:06:59,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 11:06:59,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:06:59,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:06:59,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 11:06:59,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:06:59,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 454 proven. 0 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2025-01-09 11:06:59,612 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:06:59,613 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:06:59,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [920715414] [2025-01-09 11:06:59,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [920715414] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:06:59,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:06:59,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 11:06:59,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203524683] [2025-01-09 11:06:59,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:06:59,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 11:06:59,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:06:59,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 11:06:59,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:06:59,638 INFO L87 Difference]: Start difference. First operand has 84 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 58 states have internal predecessors, (84), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) 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, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 11:06:59,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:06:59,661 INFO L93 Difference]: Finished difference Result 162 states and 283 transitions. [2025-01-09 11:06:59,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 11:06:59,663 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, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 162 [2025-01-09 11:06:59,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:06:59,669 INFO L225 Difference]: With dead ends: 162 [2025-01-09 11:06:59,669 INFO L226 Difference]: Without dead ends: 81 [2025-01-09 11:06:59,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 161 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-01-09 11:06:59,676 INFO L435 NwaCegarLoop]: 127 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, 127 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-01-09 11:06:59,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:06:59,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-01-09 11:06:59,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-01-09 11:06:59,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 55 states have internal predecessors, (79), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 11:06:59,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 127 transitions. [2025-01-09 11:06:59,715 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 127 transitions. Word has length 162 [2025-01-09 11:06:59,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:06:59,716 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 127 transitions. [2025-01-09 11:06:59,716 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, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 11:06:59,716 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 127 transitions. [2025-01-09 11:06:59,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 11:06:59,720 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:06:59,721 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 11:06:59,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-01-09 11:06:59,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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-01-09 11:06:59,922 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:06:59,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:06:59,923 INFO L85 PathProgramCache]: Analyzing trace with hash -972559280, now seen corresponding path program 1 times [2025-01-09 11:06:59,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:06:59,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [839552958] [2025-01-09 11:06:59,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:06:59,924 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-01-09 11:06:59,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:06:59,927 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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-01-09 11:06:59,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 11:06:59,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 11:07:00,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 11:07:00,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:07:00,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:07:00,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 11:07:00,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:07:00,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 11:07:00,752 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:07:00,753 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:07:00,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [839552958] [2025-01-09 11:07:00,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [839552958] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:07:00,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:07:00,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:07:00,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251963336] [2025-01-09 11:07:00,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:07:00,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 11:07:00,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:07:00,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 11:07:00,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:07:00,759 INFO L87 Difference]: Start difference. First operand 81 states and 127 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 11:07:01,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:07:01,562 INFO L93 Difference]: Finished difference Result 265 states and 421 transitions. [2025-01-09 11:07:01,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 11:07:01,573 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2025-01-09 11:07:01,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:07:01,576 INFO L225 Difference]: With dead ends: 265 [2025-01-09 11:07:01,576 INFO L226 Difference]: Without dead ends: 187 [2025-01-09 11:07:01,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 11:07:01,581 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 178 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 11:07:01,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 397 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 11:07:01,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-01-09 11:07:01,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 157. [2025-01-09 11:07:01,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 106 states have (on average 1.4433962264150944) internal successors, (153), 106 states have internal predecessors, (153), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 11:07:01,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 249 transitions. [2025-01-09 11:07:01,640 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 249 transitions. Word has length 162 [2025-01-09 11:07:01,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:07:01,641 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 249 transitions. [2025-01-09 11:07:01,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 11:07:01,643 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 249 transitions. [2025-01-09 11:07:01,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 11:07:01,647 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:07:01,647 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 11:07:01,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-01-09 11:07:01,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/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-01-09 11:07:01,848 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:07:01,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:07:01,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1106572786, now seen corresponding path program 1 times [2025-01-09 11:07:01,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:07:01,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1621102013] [2025-01-09 11:07:01,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:07:01,849 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-01-09 11:07:01,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:07:01,851 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/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-01-09 11:07:01,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 11:07:01,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 11:07:02,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 11:07:02,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:07:02,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:07:02,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 11:07:02,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:07:03,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 11:07:03,166 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:07:03,166 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:07:03,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1621102013] [2025-01-09 11:07:03,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1621102013] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:07:03,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:07:03,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 11:07:03,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451002340] [2025-01-09 11:07:03,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:07:03,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:07:03,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:07:03,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:07:03,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:07:03,168 INFO L87 Difference]: Start difference. First operand 157 states and 249 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 11:07:03,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:07:03,442 INFO L93 Difference]: Finished difference Result 313 states and 496 transitions. [2025-01-09 11:07:03,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:07:03,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2025-01-09 11:07:03,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:07:03,445 INFO L225 Difference]: With dead ends: 313 [2025-01-09 11:07:03,445 INFO L226 Difference]: Without dead ends: 159 [2025-01-09 11:07:03,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 160 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-01-09 11:07:03,448 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 47 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 11:07:03,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 250 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 11:07:03,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-01-09 11:07:03,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2025-01-09 11:07:03,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 106 states have (on average 1.4339622641509433) internal successors, (152), 106 states have internal predecessors, (152), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 11:07:03,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 248 transitions. [2025-01-09 11:07:03,489 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 248 transitions. Word has length 162 [2025-01-09 11:07:03,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:07:03,489 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 248 transitions. [2025-01-09 11:07:03,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 11:07:03,490 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 248 transitions. [2025-01-09 11:07:03,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 11:07:03,491 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:07:03,491 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 11:07:03,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)] Ended with exit code 0 [2025-01-09 11:07:03,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/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-01-09 11:07:03,695 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:07:03,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:07:03,696 INFO L85 PathProgramCache]: Analyzing trace with hash 481775116, now seen corresponding path program 1 times [2025-01-09 11:07:03,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:07:03,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1529551680] [2025-01-09 11:07:03,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:07:03,697 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-01-09 11:07:03,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:07:03,699 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/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-01-09 11:07:03,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-01-09 11:07:03,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 11:07:03,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 11:07:03,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:07:03,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:07:03,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 11:07:03,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:07:04,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 11:07:04,323 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:07:04,323 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:07:04,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1529551680] [2025-01-09 11:07:04,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1529551680] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:07:04,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:07:04,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:07:04,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432407450] [2025-01-09 11:07:04,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:07:04,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:07:04,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:07:04,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:07:04,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:07:04,325 INFO L87 Difference]: Start difference. First operand 157 states and 248 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 11:07:04,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:07:04,634 INFO L93 Difference]: Finished difference Result 159 states and 249 transitions. [2025-01-09 11:07:04,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 11:07:04,646 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2025-01-09 11:07:04,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:07:04,647 INFO L225 Difference]: With dead ends: 159 [2025-01-09 11:07:04,647 INFO L226 Difference]: Without dead ends: 81 [2025-01-09 11:07:04,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:07:04,648 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 48 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 11:07:04,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 187 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 11:07:04,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-01-09 11:07:04,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-01-09 11:07:04,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 55 states have internal predecessors, (76), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 11:07:04,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 124 transitions. [2025-01-09 11:07:04,664 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 124 transitions. Word has length 162 [2025-01-09 11:07:04,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:07:04,664 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 124 transitions. [2025-01-09 11:07:04,665 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 11:07:04,665 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 124 transitions. [2025-01-09 11:07:04,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-01-09 11:07:04,667 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:07:04,668 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 11:07:04,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2025-01-09 11:07:04,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/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-01-09 11:07:04,869 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:07:04,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:07:04,870 INFO L85 PathProgramCache]: Analyzing trace with hash -698369241, now seen corresponding path program 1 times [2025-01-09 11:07:04,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:07:04,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [691555517] [2025-01-09 11:07:04,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:07:04,871 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-01-09 11:07:04,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:07:04,874 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/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-01-09 11:07:04,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-01-09 11:07:04,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-01-09 11:07:05,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-01-09 11:07:05,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:07:05,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:07:05,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 11:07:05,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:07:05,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 581 proven. 54 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2025-01-09 11:07:05,528 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:07:05,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 39 proven. 30 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-01-09 11:07:05,841 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:07:05,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [691555517] [2025-01-09 11:07:05,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [691555517] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 11:07:05,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 11:07:05,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2025-01-09 11:07:05,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306302144] [2025-01-09 11:07:05,841 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 11:07:05,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 11:07:05,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:07:05,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 11:07:05,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-01-09 11:07:05,847 INFO L87 Difference]: Start difference. First operand 81 states and 124 transitions. Second operand has 12 states, 12 states have (on average 6.75) internal successors, (81), 12 states have internal predecessors, (81), 3 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) [2025-01-09 11:07:08,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:07:08,153 INFO L93 Difference]: Finished difference Result 368 states and 546 transitions. [2025-01-09 11:07:08,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-01-09 11:07:08,153 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 12 states have internal predecessors, (81), 3 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) Word has length 163 [2025-01-09 11:07:08,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:07:08,156 INFO L225 Difference]: With dead ends: 368 [2025-01-09 11:07:08,158 INFO L226 Difference]: Without dead ends: 290 [2025-01-09 11:07:08,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 317 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=309, Invalid=813, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 11:07:08,161 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 415 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 11:07:08,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 449 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 11:07:08,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-01-09 11:07:08,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 176. [2025-01-09 11:07:08,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 108 states have (on average 1.2592592592592593) internal successors, (136), 110 states have internal predecessors, (136), 61 states have call successors, (61), 6 states have call predecessors, (61), 6 states have return successors, (61), 59 states have call predecessors, (61), 61 states have call successors, (61) [2025-01-09 11:07:08,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 258 transitions. [2025-01-09 11:07:08,221 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 258 transitions. Word has length 163 [2025-01-09 11:07:08,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:07:08,221 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 258 transitions. [2025-01-09 11:07:08,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 12 states have internal predecessors, (81), 3 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) [2025-01-09 11:07:08,222 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 258 transitions. [2025-01-09 11:07:08,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-01-09 11:07:08,224 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:07:08,224 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 11:07:08,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-01-09 11:07:08,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/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-01-09 11:07:08,430 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:07:08,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:07:08,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1378427611, now seen corresponding path program 1 times [2025-01-09 11:07:08,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:07:08,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1488031899] [2025-01-09 11:07:08,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:07:08,431 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-01-09 11:07:08,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:07:08,434 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/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-01-09 11:07:08,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (7)] Waiting until timeout for monitored process [2025-01-09 11:07:08,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-01-09 11:07:08,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-01-09 11:07:08,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:07:08,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:07:08,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 11:07:08,741 INFO L279 TraceCheckSpWp]: Computing forward predicates...