./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-53.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_operatoramount_amount100_file-53.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 71c7df1fae20fc80c584d7fcd9c77a1cbb9d81b2af2b3bc6d67d6058472b2f60 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:08:29,221 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:08:29,278 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 14:08:29,281 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:08:29,285 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:08:29,308 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:08:29,309 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:08:29,310 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:08:29,310 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:08:29,310 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:08:29,311 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:08:29,311 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:08:29,312 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:08:29,312 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:08:29,312 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:08:29,312 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:08:29,312 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:08:29,312 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:08:29,312 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:08:29,312 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:08:29,312 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:08:29,312 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:08:29,313 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:08:29,313 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:08:29,313 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:08:29,313 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:08:29,313 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:08:29,313 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:08:29,313 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:08:29,313 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:08:29,313 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:08:29,314 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:08:29,314 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:08:29,314 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:08:29,314 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:08:29,314 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:08:29,314 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:08:29,314 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:08:29,314 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:08:29,314 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:08:29,314 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:08:29,314 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:08:29,314 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:08:29,314 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:08:29,314 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:08:29,314 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:08:29,314 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:08:29,314 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:08:29,314 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 -> 71c7df1fae20fc80c584d7fcd9c77a1cbb9d81b2af2b3bc6d67d6058472b2f60 [2025-01-09 14:08:29,547 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:08:29,555 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:08:29,556 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:08:29,558 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:08:29,558 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:08:29,559 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-53.i [2025-01-09 14:08:30,714 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fbc64d938/844916d175224805a638ac1111e0e968/FLAG18a60d389 [2025-01-09 14:08:30,955 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:08:30,957 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-53.i [2025-01-09 14:08:30,965 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fbc64d938/844916d175224805a638ac1111e0e968/FLAG18a60d389 [2025-01-09 14:08:31,284 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fbc64d938/844916d175224805a638ac1111e0e968 [2025-01-09 14:08:31,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:08:31,287 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:08:31,289 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:08:31,290 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:08:31,294 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:08:31,295 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:08:31" (1/1) ... [2025-01-09 14:08:31,297 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55bee783 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:08:31, skipping insertion in model container [2025-01-09 14:08:31,297 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:08:31" (1/1) ... [2025-01-09 14:08:31,312 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:08:31,389 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_operatoramount_amount100_file-53.i[916,929] [2025-01-09 14:08:31,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:08:31,465 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:08:31,473 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_operatoramount_amount100_file-53.i[916,929] [2025-01-09 14:08:31,515 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:08:31,528 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:08:31,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:08:31 WrapperNode [2025-01-09 14:08:31,530 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:08:31,531 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:08:31,531 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:08:31,531 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:08:31,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:08:31" (1/1) ... [2025-01-09 14:08:31,547 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:08:31" (1/1) ... [2025-01-09 14:08:31,580 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 217 [2025-01-09 14:08:31,581 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:08:31,582 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:08:31,582 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:08:31,582 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:08:31,588 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:08:31" (1/1) ... [2025-01-09 14:08:31,589 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:08:31" (1/1) ... [2025-01-09 14:08:31,595 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:08:31" (1/1) ... [2025-01-09 14:08:31,615 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 14:08:31,616 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:08:31" (1/1) ... [2025-01-09 14:08:31,616 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:08:31" (1/1) ... [2025-01-09 14:08:31,629 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:08:31" (1/1) ... [2025-01-09 14:08:31,630 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:08:31" (1/1) ... [2025-01-09 14:08:31,635 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:08:31" (1/1) ... [2025-01-09 14:08:31,637 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:08:31" (1/1) ... [2025-01-09 14:08:31,640 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:08:31" (1/1) ... [2025-01-09 14:08:31,648 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:08:31,649 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:08:31,649 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:08:31,649 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:08:31,650 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:08:31" (1/1) ... [2025-01-09 14:08:31,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:08:31,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:08:31,674 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 14:08:31,679 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 14:08:31,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:08:31,690 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:08:31,690 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:08:31,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:08:31,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:08:31,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:08:31,753 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:08:31,754 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:08:32,177 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-01-09 14:08:32,177 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:08:32,184 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:08:32,184 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:08:32,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:08:32 BoogieIcfgContainer [2025-01-09 14:08:32,185 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:08:32,186 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:08:32,186 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:08:32,189 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:08:32,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:08:31" (1/3) ... [2025-01-09 14:08:32,190 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12990a31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:08:32, skipping insertion in model container [2025-01-09 14:08:32,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:08:31" (2/3) ... [2025-01-09 14:08:32,190 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12990a31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:08:32, skipping insertion in model container [2025-01-09 14:08:32,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:08:32" (3/3) ... [2025-01-09 14:08:32,191 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-53.i [2025-01-09 14:08:32,201 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:08:32,203 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount100_file-53.i that has 2 procedures, 94 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:08:32,244 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:08:32,253 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;@396ccd9b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:08:32,254 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:08:32,257 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 66 states have (on average 1.4545454545454546) internal successors, (96), 67 states have internal predecessors, (96), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-01-09 14:08:32,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-01-09 14:08:32,267 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:08:32,268 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:08:32,268 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:08:32,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:08:32,273 INFO L85 PathProgramCache]: Analyzing trace with hash 918824768, now seen corresponding path program 1 times [2025-01-09 14:08:32,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:08:32,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26295545] [2025-01-09 14:08:32,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:08:32,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:08:32,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 14:08:32,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 14:08:32,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:08:32,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:08:32,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-01-09 14:08:32,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:08:32,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26295545] [2025-01-09 14:08:32,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26295545] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:08:32,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673735373] [2025-01-09 14:08:32,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:08:32,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:08:32,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:08:32,566 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 14:08:32,567 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 14:08:32,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 14:08:32,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 14:08:32,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:08:32,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:08:32,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:08:32,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:08:32,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-01-09 14:08:32,728 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:08:32,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673735373] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:08:32,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:08:32,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:08:32,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397373145] [2025-01-09 14:08:32,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:08:32,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:08:32,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:08:32,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:08:32,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:08:32,747 INFO L87 Difference]: Start difference. First operand has 94 states, 66 states have (on average 1.4545454545454546) internal successors, (96), 67 states have internal predecessors, (96), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) 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, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 14:08:32,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:08:32,767 INFO L93 Difference]: Finished difference Result 182 states and 312 transitions. [2025-01-09 14:08:32,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:08:32,768 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, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 169 [2025-01-09 14:08:32,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:08:32,772 INFO L225 Difference]: With dead ends: 182 [2025-01-09 14:08:32,772 INFO L226 Difference]: Without dead ends: 91 [2025-01-09 14:08:32,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 170 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 14:08:32,776 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:08:32,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:08:32,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-01-09 14:08:32,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-01-09 14:08:32,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 64 states have (on average 1.421875) internal successors, (91), 64 states have internal predecessors, (91), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-01-09 14:08:32,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 141 transitions. [2025-01-09 14:08:32,822 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 141 transitions. Word has length 169 [2025-01-09 14:08:32,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:08:32,822 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 141 transitions. [2025-01-09 14:08:32,822 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, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 14:08:32,823 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 141 transitions. [2025-01-09 14:08:32,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-01-09 14:08:32,824 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:08:32,824 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:08:32,831 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 14:08:33,025 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 14:08:33,026 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:08:33,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:08:33,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1579384326, now seen corresponding path program 1 times [2025-01-09 14:08:33,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:08:33,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304130561] [2025-01-09 14:08:33,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:08:33,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:08:33,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 14:08:33,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 14:08:33,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:08:33,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:08:36,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-01-09 14:08:36,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:08:36,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304130561] [2025-01-09 14:08:36,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304130561] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:08:36,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:08:36,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 14:08:36,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103239090] [2025-01-09 14:08:36,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:08:36,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:08:36,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:08:36,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:08:36,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:08:36,006 INFO L87 Difference]: Start difference. First operand 91 states and 141 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 14:08:37,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:08:37,568 INFO L93 Difference]: Finished difference Result 344 states and 536 transitions. [2025-01-09 14:08:37,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 14:08:37,569 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 169 [2025-01-09 14:08:37,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:08:37,573 INFO L225 Difference]: With dead ends: 344 [2025-01-09 14:08:37,573 INFO L226 Difference]: Without dead ends: 256 [2025-01-09 14:08:37,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-01-09 14:08:37,575 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 306 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:08:37,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 565 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 14:08:37,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-01-09 14:08:37,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 167. [2025-01-09 14:08:37,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 114 states have (on average 1.4210526315789473) internal successors, (162), 114 states have internal predecessors, (162), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 14:08:37,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 262 transitions. [2025-01-09 14:08:37,605 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 262 transitions. Word has length 169 [2025-01-09 14:08:37,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:08:37,606 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 262 transitions. [2025-01-09 14:08:37,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 14:08:37,607 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 262 transitions. [2025-01-09 14:08:37,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-01-09 14:08:37,610 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:08:37,610 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:08:37,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:08:37,610 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:08:37,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:08:37,612 INFO L85 PathProgramCache]: Analyzing trace with hash -828272928, now seen corresponding path program 1 times [2025-01-09 14:08:37,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:08:37,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110431761] [2025-01-09 14:08:37,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:08:37,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:08:37,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 14:08:37,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 14:08:37,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:08:37,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:08:39,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-01-09 14:08:39,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:08:39,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110431761] [2025-01-09 14:08:39,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110431761] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:08:39,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:08:39,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 14:08:39,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777939733] [2025-01-09 14:08:39,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:08:39,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:08:39,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:08:39,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:08:39,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:08:39,338 INFO L87 Difference]: Start difference. First operand 167 states and 262 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 14:08:40,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:08:40,693 INFO L93 Difference]: Finished difference Result 394 states and 614 transitions. [2025-01-09 14:08:40,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 14:08:40,694 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 170 [2025-01-09 14:08:40,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:08:40,697 INFO L225 Difference]: With dead ends: 394 [2025-01-09 14:08:40,698 INFO L226 Difference]: Without dead ends: 306 [2025-01-09 14:08:40,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:08:40,700 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 250 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:08:40,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 659 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 14:08:40,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-01-09 14:08:40,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 177. [2025-01-09 14:08:40,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 124 states have (on average 1.4435483870967742) internal successors, (179), 124 states have internal predecessors, (179), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 14:08:40,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 279 transitions. [2025-01-09 14:08:40,719 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 279 transitions. Word has length 170 [2025-01-09 14:08:40,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:08:40,719 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 279 transitions. [2025-01-09 14:08:40,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 14:08:40,719 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 279 transitions. [2025-01-09 14:08:40,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-01-09 14:08:40,721 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:08:40,721 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:08:40,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:08:40,721 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:08:40,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:08:40,721 INFO L85 PathProgramCache]: Analyzing trace with hash -405571102, now seen corresponding path program 1 times [2025-01-09 14:08:40,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:08:40,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068884467] [2025-01-09 14:08:40,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:08:40,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:08:40,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 14:08:40,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 14:08:40,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:08:40,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:08:40,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-01-09 14:08:40,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:08:40,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068884467] [2025-01-09 14:08:40,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068884467] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:08:40,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:08:40,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:08:40,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399241116] [2025-01-09 14:08:40,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:08:40,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:08:40,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:08:40,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:08:40,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:08:40,822 INFO L87 Difference]: Start difference. First operand 177 states and 279 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 14:08:40,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:08:40,906 INFO L93 Difference]: Finished difference Result 403 states and 634 transitions. [2025-01-09 14:08:40,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:08:40,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 170 [2025-01-09 14:08:40,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:08:40,910 INFO L225 Difference]: With dead ends: 403 [2025-01-09 14:08:40,910 INFO L226 Difference]: Without dead ends: 289 [2025-01-09 14:08:40,910 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 14:08:40,912 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 129 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:08:40,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 418 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:08:40,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-01-09 14:08:40,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 234. [2025-01-09 14:08:40,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 175 states have (on average 1.4514285714285715) internal successors, (254), 176 states have internal predecessors, (254), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 14:08:40,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 362 transitions. [2025-01-09 14:08:40,936 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 362 transitions. Word has length 170 [2025-01-09 14:08:40,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:08:40,937 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 362 transitions. [2025-01-09 14:08:40,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 14:08:40,937 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 362 transitions. [2025-01-09 14:08:40,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-01-09 14:08:40,939 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:08:40,939 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:08:40,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:08:40,940 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:08:40,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:08:40,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1657063354, now seen corresponding path program 1 times [2025-01-09 14:08:40,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:08:40,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791268993] [2025-01-09 14:08:40,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:08:40,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:08:40,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 14:08:41,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 14:08:41,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:08:41,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:08:42,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-01-09 14:08:42,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:08:42,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791268993] [2025-01-09 14:08:42,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791268993] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:08:42,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:08:42,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 14:08:42,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226440619] [2025-01-09 14:08:42,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:08:42,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 14:08:42,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:08:42,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 14:08:42,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:08:42,451 INFO L87 Difference]: Start difference. First operand 234 states and 362 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 14:08:43,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:08:43,825 INFO L93 Difference]: Finished difference Result 639 states and 994 transitions. [2025-01-09 14:08:43,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 14:08:43,826 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 170 [2025-01-09 14:08:43,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:08:43,829 INFO L225 Difference]: With dead ends: 639 [2025-01-09 14:08:43,830 INFO L226 Difference]: Without dead ends: 488 [2025-01-09 14:08:43,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-01-09 14:08:43,831 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 415 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:08:43,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 786 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 14:08:43,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2025-01-09 14:08:43,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 239. [2025-01-09 14:08:43,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 180 states have (on average 1.4555555555555555) internal successors, (262), 181 states have internal predecessors, (262), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 14:08:43,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 370 transitions. [2025-01-09 14:08:43,850 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 370 transitions. Word has length 170 [2025-01-09 14:08:43,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:08:43,851 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 370 transitions. [2025-01-09 14:08:43,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 14:08:43,852 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 370 transitions. [2025-01-09 14:08:43,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 14:08:43,854 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:08:43,854 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:08:43,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:08:43,855 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:08:43,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:08:43,855 INFO L85 PathProgramCache]: Analyzing trace with hash 990271845, now seen corresponding path program 1 times [2025-01-09 14:08:43,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:08:43,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275479599] [2025-01-09 14:08:43,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:08:43,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:08:43,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 14:08:43,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 14:08:43,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:08:43,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:08:44,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-01-09 14:08:44,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:08:44,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275479599] [2025-01-09 14:08:44,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275479599] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:08:44,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:08:44,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:08:44,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74500037] [2025-01-09 14:08:44,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:08:44,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:08:44,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:08:44,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:08:44,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:08:44,011 INFO L87 Difference]: Start difference. First operand 239 states and 370 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, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 14:08:44,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:08:44,102 INFO L93 Difference]: Finished difference Result 408 states and 631 transitions. [2025-01-09 14:08:44,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:08:44,103 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, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 171 [2025-01-09 14:08:44,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:08:44,104 INFO L225 Difference]: With dead ends: 408 [2025-01-09 14:08:44,104 INFO L226 Difference]: Without dead ends: 244 [2025-01-09 14:08:44,105 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 14:08:44,105 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 60 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:08:44,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 293 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:08:44,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-01-09 14:08:44,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 241. [2025-01-09 14:08:44,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 182 states have (on average 1.4505494505494505) internal successors, (264), 183 states have internal predecessors, (264), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 14:08:44,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 372 transitions. [2025-01-09 14:08:44,121 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 372 transitions. Word has length 171 [2025-01-09 14:08:44,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:08:44,123 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 372 transitions. [2025-01-09 14:08:44,123 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, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 14:08:44,123 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 372 transitions. [2025-01-09 14:08:44,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 14:08:44,124 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:08:44,125 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:08:44,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:08:44,125 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:08:44,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:08:44,125 INFO L85 PathProgramCache]: Analyzing trace with hash 545035585, now seen corresponding path program 1 times [2025-01-09 14:08:44,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:08:44,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568656350] [2025-01-09 14:08:44,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:08:44,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:08:44,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 14:08:44,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 14:08:44,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:08:44,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:08:44,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 6 proven. 66 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-01-09 14:08:44,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:08:44,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568656350] [2025-01-09 14:08:44,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568656350] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:08:44,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808014040] [2025-01-09 14:08:44,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:08:44,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:08:44,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:08:44,648 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 14:08:44,650 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 14:08:44,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 14:08:44,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 14:08:44,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:08:44,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:08:44,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 14:08:44,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:08:45,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 204 proven. 66 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2025-01-09 14:08:45,571 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:08:46,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 6 proven. 66 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-01-09 14:08:46,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808014040] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:08:46,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:08:46,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 10] total 24 [2025-01-09 14:08:46,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441258688] [2025-01-09 14:08:46,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:08:46,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-09 14:08:46,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:08:46,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-09 14:08:46,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2025-01-09 14:08:46,062 INFO L87 Difference]: Start difference. First operand 241 states and 372 transitions. Second operand has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 24 states have internal predecessors, (130), 6 states have call successors, (75), 3 states have call predecessors, (75), 6 states have return successors, (75), 6 states have call predecessors, (75), 6 states have call successors, (75) [2025-01-09 14:08:47,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:08:47,935 INFO L93 Difference]: Finished difference Result 846 states and 1244 transitions. [2025-01-09 14:08:47,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-01-09 14:08:47,935 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 24 states have internal predecessors, (130), 6 states have call successors, (75), 3 states have call predecessors, (75), 6 states have return successors, (75), 6 states have call predecessors, (75), 6 states have call successors, (75) Word has length 171 [2025-01-09 14:08:47,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:08:47,938 INFO L225 Difference]: With dead ends: 846 [2025-01-09 14:08:47,938 INFO L226 Difference]: Without dead ends: 692 [2025-01-09 14:08:47,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 787 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=637, Invalid=2785, Unknown=0, NotChecked=0, Total=3422 [2025-01-09 14:08:47,939 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 1027 mSDsluCounter, 2308 mSDsCounter, 0 mSdLazyCounter, 2637 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1080 SdHoareTripleChecker+Valid, 2551 SdHoareTripleChecker+Invalid, 2874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 2637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:08:47,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1080 Valid, 2551 Invalid, 2874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 2637 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 14:08:47,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2025-01-09 14:08:47,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 457. [2025-01-09 14:08:47,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 366 states have (on average 1.46448087431694) internal successors, (536), 368 states have internal predecessors, (536), 83 states have call successors, (83), 7 states have call predecessors, (83), 7 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-01-09 14:08:47,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 702 transitions. [2025-01-09 14:08:47,962 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 702 transitions. Word has length 171 [2025-01-09 14:08:47,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:08:47,962 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 702 transitions. [2025-01-09 14:08:47,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 24 states have internal predecessors, (130), 6 states have call successors, (75), 3 states have call predecessors, (75), 6 states have return successors, (75), 6 states have call predecessors, (75), 6 states have call successors, (75) [2025-01-09 14:08:47,962 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 702 transitions. [2025-01-09 14:08:47,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 14:08:47,963 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:08:47,964 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:08:47,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 14:08:48,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:08:48,168 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:08:48,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:08:48,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1579776940, now seen corresponding path program 1 times [2025-01-09 14:08:48,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:08:48,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231020594] [2025-01-09 14:08:48,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:08:48,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:08:48,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 14:08:48,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 14:08:48,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:08:48,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:08:49,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-01-09 14:08:49,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:08:49,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231020594] [2025-01-09 14:08:49,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231020594] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:08:49,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:08:49,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 14:08:49,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374374904] [2025-01-09 14:08:49,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:08:49,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:08:49,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:08:49,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:08:49,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:08:49,433 INFO L87 Difference]: Start difference. First operand 457 states and 702 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 14:08:50,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:08:50,184 INFO L93 Difference]: Finished difference Result 1183 states and 1807 transitions. [2025-01-09 14:08:50,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 14:08:50,185 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 171 [2025-01-09 14:08:50,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:08:50,189 INFO L225 Difference]: With dead ends: 1183 [2025-01-09 14:08:50,189 INFO L226 Difference]: Without dead ends: 881 [2025-01-09 14:08:50,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:08:50,190 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 385 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:08:50,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 462 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 14:08:50,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2025-01-09 14:08:50,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 457. [2025-01-09 14:08:50,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 366 states have (on average 1.46448087431694) internal successors, (536), 368 states have internal predecessors, (536), 83 states have call successors, (83), 7 states have call predecessors, (83), 7 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-01-09 14:08:50,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 702 transitions. [2025-01-09 14:08:50,235 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 702 transitions. Word has length 171 [2025-01-09 14:08:50,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:08:50,236 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 702 transitions. [2025-01-09 14:08:50,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 14:08:50,236 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 702 transitions. [2025-01-09 14:08:50,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-01-09 14:08:50,239 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:08:50,240 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:08:50,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:08:50,240 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:08:50,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:08:50,240 INFO L85 PathProgramCache]: Analyzing trace with hash -178787919, now seen corresponding path program 1 times [2025-01-09 14:08:50,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:08:50,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484792994] [2025-01-09 14:08:50,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:08:50,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:08:50,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-09 14:08:50,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-09 14:08:50,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:08:50,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:08:51,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-01-09 14:08:51,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:08:51,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484792994] [2025-01-09 14:08:51,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484792994] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:08:51,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:08:51,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 14:08:51,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533246261] [2025-01-09 14:08:51,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:08:51,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:08:51,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:08:51,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:08:51,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:08:51,567 INFO L87 Difference]: Start difference. First operand 457 states and 702 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 14:08:52,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:08:52,033 INFO L93 Difference]: Finished difference Result 1101 states and 1689 transitions. [2025-01-09 14:08:52,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 14:08:52,033 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 172 [2025-01-09 14:08:52,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:08:52,037 INFO L225 Difference]: With dead ends: 1101 [2025-01-09 14:08:52,037 INFO L226 Difference]: Without dead ends: 799 [2025-01-09 14:08:52,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:08:52,040 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 124 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:08:52,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 356 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:08:52,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2025-01-09 14:08:52,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 519. [2025-01-09 14:08:52,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 428 states have (on average 1.4906542056074767) internal successors, (638), 430 states have internal predecessors, (638), 83 states have call successors, (83), 7 states have call predecessors, (83), 7 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-01-09 14:08:52,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 804 transitions. [2025-01-09 14:08:52,072 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 804 transitions. Word has length 172 [2025-01-09 14:08:52,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:08:52,072 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 804 transitions. [2025-01-09 14:08:52,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 14:08:52,072 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 804 transitions. [2025-01-09 14:08:52,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-01-09 14:08:52,073 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:08:52,074 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:08:52,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:08:52,074 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:08:52,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:08:52,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1773787035, now seen corresponding path program 1 times [2025-01-09 14:08:52,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:08:52,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127141468] [2025-01-09 14:08:52,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:08:52,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:08:52,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-09 14:08:52,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-09 14:08:52,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:08:52,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 14:08:52,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1863754991] [2025-01-09 14:08:52,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:08:52,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:08:52,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:08:52,215 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 14:08:52,217 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 14:08:52,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-09 14:08:52,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-09 14:08:52,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:08:52,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 14:08:52,337 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 14:08:52,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-09 14:08:52,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-09 14:08:52,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:08:52,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 14:08:52,498 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 14:08:52,498 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 14:08:52,499 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 14:08:52,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 14:08:52,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:08:52,706 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:08:52,802 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 14:08:52,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 02:08:52 BoogieIcfgContainer [2025-01-09 14:08:52,804 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 14:08:52,804 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 14:08:52,804 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 14:08:52,805 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 14:08:52,805 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:08:32" (3/4) ... [2025-01-09 14:08:52,806 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 14:08:52,807 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 14:08:52,807 INFO L158 Benchmark]: Toolchain (without parser) took 21520.32ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 111.2MB in the beginning and 282.7MB in the end (delta: -171.4MB). Peak memory consumption was 168.1MB. Max. memory is 16.1GB. [2025-01-09 14:08:52,807 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:08:52,807 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.23ms. Allocated memory is still 142.6MB. Free memory was 111.2MB in the beginning and 93.4MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 14:08:52,808 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.66ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 85.6MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:08:52,808 INFO L158 Benchmark]: Boogie Preprocessor took 66.73ms. Allocated memory is still 142.6MB. Free memory was 85.6MB in the beginning and 69.9MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 14:08:52,808 INFO L158 Benchmark]: RCFGBuilder took 535.89ms. Allocated memory is still 142.6MB. Free memory was 69.9MB in the beginning and 96.9MB in the end (delta: -26.9MB). Peak memory consumption was 41.2MB. Max. memory is 16.1GB. [2025-01-09 14:08:52,808 INFO L158 Benchmark]: TraceAbstraction took 20617.95ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 96.1MB in the beginning and 282.7MB in the end (delta: -186.7MB). Peak memory consumption was 143.6MB. Max. memory is 16.1GB. [2025-01-09 14:08:52,808 INFO L158 Benchmark]: Witness Printer took 2.47ms. Allocated memory is still 478.2MB. Free memory was 282.7MB in the beginning and 282.7MB in the end (delta: 64.5kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:08:52,809 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.20ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 241.23ms. Allocated memory is still 142.6MB. Free memory was 111.2MB in the beginning and 93.4MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.66ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 85.6MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.73ms. Allocated memory is still 142.6MB. Free memory was 85.6MB in the beginning and 69.9MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * RCFGBuilder took 535.89ms. Allocated memory is still 142.6MB. Free memory was 69.9MB in the beginning and 96.9MB in the end (delta: -26.9MB). Peak memory consumption was 41.2MB. Max. memory is 16.1GB. * TraceAbstraction took 20617.95ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 96.1MB in the beginning and 282.7MB in the end (delta: -186.7MB). Peak memory consumption was 143.6MB. Max. memory is 16.1GB. * Witness Printer took 2.47ms. Allocated memory is still 478.2MB. Free memory was 282.7MB in the beginning and 282.7MB in the end (delta: 64.5kB). 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 someBinaryFLOATComparisonOperation at line 165, overapproximation of someBinaryFLOATComparisonOperation at line 193, overapproximation of someBinaryFLOATComparisonOperation at line 167, overapproximation of someBinaryFLOATComparisonOperation at line 169, overapproximation of someUnaryDOUBLEoperation at line 38, overapproximation of someBinaryDOUBLEComparisonOperation at line 174, overapproximation of someBinaryDOUBLEComparisonOperation at line 175, overapproximation of someBinaryDOUBLEComparisonOperation at line 193, overapproximation of someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryArithmeticFLOAToperation at line 91. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -100; [L23] unsigned char var_1_2 = 200; [L24] unsigned char var_1_3 = 100; [L25] unsigned char var_1_4 = 8; [L26] unsigned char var_1_7 = 16; [L27] unsigned char var_1_9 = 0; [L28] unsigned char var_1_12 = 0; [L29] unsigned char var_1_13 = 0; [L30] unsigned char var_1_14 = 0; [L31] unsigned char var_1_15 = 1; [L32] unsigned char var_1_16 = 0; [L33] unsigned short int var_1_17 = 256; [L34] signed short int var_1_19 = -100; [L35] signed short int var_1_20 = 32; [L36] unsigned char var_1_21 = 1; [L37] signed short int var_1_23 = -256; [L38] float var_1_24 = -0.5; [L39] float var_1_25 = 255.8; [L40] float var_1_26 = 31.2; [L41] float var_1_27 = 0.5; [L42] unsigned char var_1_28 = 32; [L43] unsigned char var_1_29 = 64; [L44] unsigned short int var_1_30 = 16; [L45] double var_1_31 = 255.9; [L46] unsigned short int var_1_33 = 39141; [L47] unsigned short int var_1_34 = 52589; [L48] signed long int last_1_var_1_1 = -100; [L49] unsigned char last_1_var_1_7 = 16; [L50] unsigned short int last_1_var_1_17 = 256; [L51] signed short int last_1_var_1_19 = -100; [L52] signed short int last_1_var_1_20 = 32; [L53] signed short int last_1_var_1_23 = -256; [L54] unsigned char last_1_var_1_28 = 32; VAL [isInitial=0, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=200, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=100, var_1_4=8, var_1_7=16, var_1_9=0] [L197] isInitial = 1 [L198] FCALL initially() [L200] CALL updateLastVariables() [L184] last_1_var_1_1 = var_1_1 [L185] last_1_var_1_7 = var_1_7 [L186] last_1_var_1_17 = var_1_17 [L187] last_1_var_1_19 = var_1_19 [L188] last_1_var_1_20 = var_1_20 [L189] last_1_var_1_23 = var_1_23 [L190] last_1_var_1_28 = var_1_28 VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=200, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=100, var_1_4=8, var_1_7=16, var_1_9=0] [L200] RET updateLastVariables() [L201] CALL updateVariables() [L143] var_1_2 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_2 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=100, var_1_4=8, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=100, var_1_4=8, var_1_7=16, var_1_9=0] [L144] RET assume_abort_if_not(var_1_2 >= 127) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=100, var_1_4=8, var_1_7=16, var_1_9=0] [L145] CALL assume_abort_if_not(var_1_2 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=100, var_1_4=8, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=100, var_1_4=8, var_1_7=16, var_1_9=0] [L145] RET assume_abort_if_not(var_1_2 <= 255) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=100, var_1_4=8, var_1_7=16, var_1_9=0] [L146] var_1_3 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_3 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=8, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=8, var_1_7=16, var_1_9=0] [L147] RET assume_abort_if_not(var_1_3 >= 63) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=8, var_1_7=16, var_1_9=0] [L148] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=8, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=8, var_1_7=16, var_1_9=0] [L148] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=8, var_1_7=16, var_1_9=0] [L149] var_1_4 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_7=16, var_1_9=0] [L150] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_7=16, var_1_9=0] [L151] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L151] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L152] var_1_12 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L153] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L154] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L154] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L155] var_1_13 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L156] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L157] CALL assume_abort_if_not(var_1_13 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L157] RET assume_abort_if_not(var_1_13 <= 0) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L158] var_1_15 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L159] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L160] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L160] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L161] var_1_16 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L162] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L163] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L163] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L164] var_1_25 = __VERIFIER_nondet_float() [L165] CALL assume_abort_if_not((var_1_25 >= -461168.6018427382800e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 4611686.018427382800e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L165] RET assume_abort_if_not((var_1_25 >= -461168.6018427382800e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 4611686.018427382800e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L166] var_1_26 = __VERIFIER_nondet_float() [L167] CALL assume_abort_if_not((var_1_26 >= -461168.6018427382800e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L167] RET assume_abort_if_not((var_1_26 >= -461168.6018427382800e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L168] var_1_27 = __VERIFIER_nondet_float() [L169] CALL assume_abort_if_not((var_1_27 >= -461168.6018427382800e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 4611686.018427382800e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L169] RET assume_abort_if_not((var_1_27 >= -461168.6018427382800e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 4611686.018427382800e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L170] var_1_29 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_29 >= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L171] RET assume_abort_if_not(var_1_29 >= 64) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L172] CALL assume_abort_if_not(var_1_29 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L172] RET assume_abort_if_not(var_1_29 <= 127) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L173] var_1_31 = __VERIFIER_nondet_double() [L174] CALL assume_abort_if_not((var_1_31 >= -922337.2036854776000e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854776000e+12F && var_1_31 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L174] RET assume_abort_if_not((var_1_31 >= -922337.2036854776000e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854776000e+12F && var_1_31 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L175] CALL assume_abort_if_not(var_1_31 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L175] RET assume_abort_if_not(var_1_31 != 0.0F) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L176] var_1_33 = __VERIFIER_nondet_ushort() [L177] CALL assume_abort_if_not(var_1_33 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_33=32767, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_33=32767, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L177] RET assume_abort_if_not(var_1_33 >= 32767) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_33=32767, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L178] CALL assume_abort_if_not(var_1_33 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_33=32767, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_33=32767, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L178] RET assume_abort_if_not(var_1_33 <= 65534) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_33=32767, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L179] var_1_34 = __VERIFIER_nondet_ushort() [L180] CALL assume_abort_if_not(var_1_34 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_33=32767, var_1_34=-32769, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_33=32767, var_1_34=-32769, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L180] RET assume_abort_if_not(var_1_34 >= 32767) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_33=32767, var_1_34=-32769, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L181] CALL assume_abort_if_not(var_1_34 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_33=32767, var_1_34=-32769, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_33=32767, var_1_34=-32769, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L181] RET assume_abort_if_not(var_1_34 <= 65534) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_33=32767, var_1_34=-32769, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L201] RET updateVariables() [L202] CALL step() [L58] COND FALSE !((var_1_2 - (var_1_3 - var_1_4)) == last_1_var_1_7) [L67] var_1_1 = var_1_2 VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=128, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_33=32767, var_1_34=-32769, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L69] unsigned char stepLocal_3 = var_1_4; [L70] signed long int stepLocal_2 = last_1_var_1_17; VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_2=256, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=128, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_33=32767, var_1_34=-32769, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L71] COND FALSE !(stepLocal_2 < ((((var_1_2) > (var_1_4)) ? (var_1_2) : (var_1_4)))) [L78] var_1_14 = var_1_15 VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=128, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_33=32767, var_1_34=-32769, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L80] unsigned char stepLocal_1 = last_1_var_1_28 < (var_1_3 - var_1_4); [L81] signed long int stepLocal_0 = last_1_var_1_28; VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_0=32, stepLocal_1=1, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=128, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_33=32767, var_1_34=-32769, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L82] COND TRUE stepLocal_1 || (last_1_var_1_23 > (last_1_var_1_19 * last_1_var_1_1)) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_0=32, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=128, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_33=32767, var_1_34=-32769, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L83] COND TRUE stepLocal_0 >= var_1_4 [L84] var_1_7 = 2 VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=128, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_33=32767, var_1_34=-32769, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L91] var_1_24 = (var_1_25 + ((((var_1_26) < (var_1_27)) ? (var_1_26) : (var_1_27)))) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=128, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=128, var_1_30=16, var_1_33=32767, var_1_34=-32769, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L92] COND TRUE ! var_1_12 [L93] var_1_28 = ((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) + var_1_29) - var_1_4) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=128, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=191, var_1_29=64, var_1_2=128, var_1_30=16, var_1_33=32767, var_1_34=-32769, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L97] COND TRUE (var_1_24 / var_1_31) > var_1_24 [L98] var_1_30 = (((((var_1_33) > (var_1_34)) ? (var_1_33) : (var_1_34))) - var_1_4) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=128, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=191, var_1_29=64, var_1_2=128, var_1_30=32767, var_1_33=32767, var_1_34=-32769, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L100] EXPR var_1_4 ^ var_1_1 VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=128, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=191, var_1_29=64, var_1_2=128, var_1_30=32767, var_1_33=32767, var_1_34=-32769, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L100] COND FALSE !(var_1_1 != (var_1_4 ^ var_1_1)) [L109] unsigned char stepLocal_6 = var_1_9; VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, stepLocal_6=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=128, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=191, var_1_29=64, var_1_2=128, var_1_30=32767, var_1_33=32767, var_1_34=-32769, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L110] COND TRUE stepLocal_6 || (var_1_28 >= last_1_var_1_20) [L111] var_1_20 = (((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) + var_1_4) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=128, var_1_20=128, var_1_21=1, var_1_23=-256, var_1_28=191, var_1_29=64, var_1_2=128, var_1_30=32767, var_1_33=32767, var_1_34=-32769, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L115] unsigned char stepLocal_8 = var_1_28 > var_1_7; VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, stepLocal_8=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=128, var_1_20=128, var_1_21=1, var_1_23=-256, var_1_28=191, var_1_29=64, var_1_2=128, var_1_30=32767, var_1_33=32767, var_1_34=-32769, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L116] COND TRUE stepLocal_8 || var_1_14 [L117] var_1_23 = (((((var_1_3 + (var_1_2 - var_1_28))) < (var_1_4)) ? ((var_1_3 + (var_1_2 - var_1_28))) : (var_1_4))) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=128, var_1_20=128, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=64, var_1_2=128, var_1_30=32767, var_1_33=32767, var_1_34=-32769, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L121] var_1_19 = ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (var_1_28)) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_28))) [L122] unsigned char stepLocal_7 = ((((var_1_23) > (var_1_19)) ? (var_1_23) : (var_1_19))) <= 0; VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, stepLocal_7=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=0, var_1_1=128, var_1_20=128, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=64, var_1_2=128, var_1_30=32767, var_1_33=32767, var_1_34=-32769, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L123] COND FALSE !(stepLocal_7 && var_1_13) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=0, var_1_1=128, var_1_20=128, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=64, var_1_2=128, var_1_30=32767, var_1_33=32767, var_1_34=-32769, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L128] signed short int stepLocal_5 = var_1_23; [L129] unsigned char stepLocal_4 = var_1_12; VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, stepLocal_4=0, stepLocal_5=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=0, var_1_1=128, var_1_20=128, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=64, var_1_2=128, var_1_30=32767, var_1_33=32767, var_1_34=-32769, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L130] COND FALSE !((var_1_28 / (2571661009u - var_1_2)) != stepLocal_5) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, stepLocal_4=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=0, var_1_1=128, var_1_20=128, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=64, var_1_2=128, var_1_30=32767, var_1_33=32767, var_1_34=-32769, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L135] COND TRUE \read(var_1_21) [L136] var_1_17 = var_1_7 VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, stepLocal_4=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=2, var_1_19=0, var_1_1=128, var_1_20=128, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=64, var_1_2=128, var_1_30=32767, var_1_33=32767, var_1_34=-32769, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L202] RET step() [L203] CALL, EXPR property() [L193] EXPR ((((var_1_2 - (var_1_3 - var_1_4)) == last_1_var_1_7) ? (((var_1_3 + last_1_var_1_7) >= (var_1_4 / var_1_2)) ? ((last_1_var_1_7 > var_1_4) ? (var_1_1 == ((signed long int) (var_1_4 + last_1_var_1_20))) : (var_1_1 == ((signed long int) var_1_2))) : 1) : (var_1_1 == ((signed long int) var_1_2))) && (((last_1_var_1_28 < (var_1_3 - var_1_4)) || (last_1_var_1_23 > (last_1_var_1_19 * last_1_var_1_1))) ? ((last_1_var_1_28 >= var_1_4) ? (var_1_7 == ((unsigned char) 2)) : (var_1_7 == ((unsigned char) var_1_4))) : (var_1_7 == ((unsigned char) var_1_3)))) && ((var_1_1 != (var_1_4 ^ var_1_1)) ? (var_1_14 ? (var_1_14 ? (var_1_9 == ((unsigned char) (var_1_12 || (! (! var_1_13))))) : 1) : (var_1_9 == ((unsigned char) var_1_13))) : 1) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=2, var_1_19=0, var_1_1=128, var_1_20=128, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=64, var_1_2=128, var_1_30=32767, var_1_33=32767, var_1_34=-32769, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L193] EXPR var_1_4 ^ var_1_1 VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=2, var_1_19=0, var_1_1=128, var_1_20=128, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=64, var_1_2=128, var_1_30=32767, var_1_33=32767, var_1_34=-32769, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L193] EXPR ((((var_1_2 - (var_1_3 - var_1_4)) == last_1_var_1_7) ? (((var_1_3 + last_1_var_1_7) >= (var_1_4 / var_1_2)) ? ((last_1_var_1_7 > var_1_4) ? (var_1_1 == ((signed long int) (var_1_4 + last_1_var_1_20))) : (var_1_1 == ((signed long int) var_1_2))) : 1) : (var_1_1 == ((signed long int) var_1_2))) && (((last_1_var_1_28 < (var_1_3 - var_1_4)) || (last_1_var_1_23 > (last_1_var_1_19 * last_1_var_1_1))) ? ((last_1_var_1_28 >= var_1_4) ? (var_1_7 == ((unsigned char) 2)) : (var_1_7 == ((unsigned char) var_1_4))) : (var_1_7 == ((unsigned char) var_1_3)))) && ((var_1_1 != (var_1_4 ^ var_1_1)) ? (var_1_14 ? (var_1_14 ? (var_1_9 == ((unsigned char) (var_1_12 || (! (! var_1_13))))) : 1) : (var_1_9 == ((unsigned char) var_1_13))) : 1) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=2, var_1_19=0, var_1_1=128, var_1_20=128, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=64, var_1_2=128, var_1_30=32767, var_1_33=32767, var_1_34=-32769, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L193-L194] return (((((((((((((var_1_2 - (var_1_3 - var_1_4)) == last_1_var_1_7) ? (((var_1_3 + last_1_var_1_7) >= (var_1_4 / var_1_2)) ? ((last_1_var_1_7 > var_1_4) ? (var_1_1 == ((signed long int) (var_1_4 + last_1_var_1_20))) : (var_1_1 == ((signed long int) var_1_2))) : 1) : (var_1_1 == ((signed long int) var_1_2))) && (((last_1_var_1_28 < (var_1_3 - var_1_4)) || (last_1_var_1_23 > (last_1_var_1_19 * last_1_var_1_1))) ? ((last_1_var_1_28 >= var_1_4) ? (var_1_7 == ((unsigned char) 2)) : (var_1_7 == ((unsigned char) var_1_4))) : (var_1_7 == ((unsigned char) var_1_3)))) && ((var_1_1 != (var_1_4 ^ var_1_1)) ? (var_1_14 ? (var_1_14 ? (var_1_9 == ((unsigned char) (var_1_12 || (! (! var_1_13))))) : 1) : (var_1_9 == ((unsigned char) var_1_13))) : 1)) && ((last_1_var_1_17 < ((((var_1_2) > (var_1_4)) ? (var_1_2) : (var_1_4)))) ? ((var_1_4 >= last_1_var_1_19) ? (var_1_14 == ((unsigned char) var_1_12)) : (var_1_14 == ((unsigned char) (var_1_15 && var_1_16)))) : (var_1_14 == ((unsigned char) var_1_15)))) && (((var_1_28 / (2571661009u - var_1_2)) != var_1_23) ? ((var_1_12 && var_1_21) ? (var_1_17 == ((unsigned short int) 2)) : 1) : (var_1_21 ? (var_1_17 == ((unsigned short int) var_1_7)) : (var_1_17 == ((unsigned short int) var_1_2))))) && (var_1_19 == ((signed short int) ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (var_1_28)) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_28)))))) && ((var_1_9 || (var_1_28 >= last_1_var_1_20)) ? (var_1_20 == ((signed short int) (((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) + var_1_4))) : (var_1_20 == ((signed short int) (var_1_4 - (((((((last_1_var_1_20) > (var_1_3)) ? (last_1_var_1_20) : (var_1_3))) < 0 ) ? -((((last_1_var_1_20) > (var_1_3)) ? (last_1_var_1_20) : (var_1_3))) : ((((last_1_var_1_20) > (var_1_3)) ? (last_1_var_1_20) : (var_1_3)))))))))) && (((((((var_1_23) > (var_1_19)) ? (var_1_23) : (var_1_19))) <= 0) && var_1_13) ? (var_1_14 ? (var_1_21 == ((unsigned char) var_1_16)) : 1) : 1)) && (((var_1_28 > var_1_7) || var_1_14) ? (var_1_23 == ((signed short int) (((((var_1_3 + (var_1_2 - var_1_28))) < (var_1_4)) ? ((var_1_3 + (var_1_2 - var_1_28))) : (var_1_4))))) : (var_1_23 == ((signed short int) (var_1_2 - var_1_28))))) && (var_1_24 == ((float) (var_1_25 + ((((var_1_26) < (var_1_27)) ? (var_1_26) : (var_1_27))))))) && ((! var_1_12) ? (var_1_28 == ((unsigned char) ((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) + var_1_29) - var_1_4))) : (var_1_28 == ((unsigned char) ((((((((var_1_29) < (var_1_4)) ? (var_1_29) : (var_1_4)))) > (var_1_3)) ? (((((var_1_29) < (var_1_4)) ? (var_1_29) : (var_1_4)))) : (var_1_3))))))) && (((var_1_24 / var_1_31) > var_1_24) ? (var_1_30 == ((unsigned short int) (((((var_1_33) > (var_1_34)) ? (var_1_33) : (var_1_34))) - var_1_4))) : 1) ; [L203] RET, EXPR property() [L203] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=2, var_1_19=0, var_1_1=128, var_1_20=128, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=64, var_1_2=128, var_1_30=32767, var_1_33=32767, var_1_34=-32769, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=2, var_1_19=0, var_1_1=128, var_1_20=128, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=64, var_1_2=128, var_1_30=32767, var_1_33=32767, var_1_34=-32769, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.5s, OverallIterations: 10, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2749 SdHoareTripleChecker+Valid, 5.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2696 mSDsluCounter, 6231 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4929 mSDsCounter, 433 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4951 IncrementalHoareTripleChecker+Invalid, 5384 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 433 mSolverCounterUnsat, 1302 mSDtfsCounter, 4951 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 647 GetRequests, 532 SyntacticMatches, 1 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=519occurred in iteration=9, InterpolantAutomatonStates: 99, 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, 9 MinimizatonAttempts, 1464 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 10.4s InterpolantComputationTime, 2217 NumberOfCodeBlocks, 2217 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2032 ConstructedInterpolants, 0 QuantifiedInterpolants, 17561 SizeOfPredicates, 5 NumberOfNonLiveVariables, 837 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 14154/14400 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 14:08:52,898 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_operatoramount_amount100_file-53.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 71c7df1fae20fc80c584d7fcd9c77a1cbb9d81b2af2b3bc6d67d6058472b2f60 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:08:54,579 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:08:54,652 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 14:08:54,656 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:08:54,657 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:08:54,681 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:08:54,682 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:08:54,682 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:08:54,682 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:08:54,683 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:08:54,683 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:08:54,683 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:08:54,684 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:08:54,684 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:08:54,684 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:08:54,684 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:08:54,684 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:08:54,684 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:08:54,684 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:08:54,684 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:08:54,684 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:08:54,684 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:08:54,684 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:08:54,684 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 14:08:54,685 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 14:08:54,685 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 14:08:54,685 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:08:54,685 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:08:54,685 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:08:54,685 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:08:54,685 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:08:54,685 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:08:54,685 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:08:54,685 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:08:54,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:08:54,685 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:08:54,685 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:08:54,685 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:08:54,685 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:08:54,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:08:54,685 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:08:54,686 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:08:54,686 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:08:54,686 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:08:54,686 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 14:08:54,686 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 14:08:54,686 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:08:54,686 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:08:54,686 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:08:54,686 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:08:54,687 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 -> 71c7df1fae20fc80c584d7fcd9c77a1cbb9d81b2af2b3bc6d67d6058472b2f60 [2025-01-09 14:08:54,910 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:08:54,916 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:08:54,918 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:08:54,919 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:08:54,919 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:08:54,921 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-53.i [2025-01-09 14:08:56,045 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/41787e4d1/d88c58d1e5914dbd8659db4a7e9264eb/FLAGe0330ee20 [2025-01-09 14:08:56,243 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:08:56,243 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-53.i [2025-01-09 14:08:56,252 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/41787e4d1/d88c58d1e5914dbd8659db4a7e9264eb/FLAGe0330ee20 [2025-01-09 14:08:56,605 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/41787e4d1/d88c58d1e5914dbd8659db4a7e9264eb [2025-01-09 14:08:56,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:08:56,608 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:08:56,609 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:08:56,609 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:08:56,612 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:08:56,613 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:08:56" (1/1) ... [2025-01-09 14:08:56,613 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@210aa6e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:08:56, skipping insertion in model container [2025-01-09 14:08:56,613 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:08:56" (1/1) ... [2025-01-09 14:08:56,632 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:08:56,733 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_operatoramount_amount100_file-53.i[916,929] [2025-01-09 14:08:56,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:08:56,809 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:08:56,816 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_operatoramount_amount100_file-53.i[916,929] [2025-01-09 14:08:56,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:08:56,859 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:08:56,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:08:56 WrapperNode [2025-01-09 14:08:56,860 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:08:56,860 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:08:56,860 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:08:56,860 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:08:56,864 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:08:56" (1/1) ... [2025-01-09 14:08:56,871 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:08:56" (1/1) ... [2025-01-09 14:08:56,893 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 190 [2025-01-09 14:08:56,894 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:08:56,894 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:08:56,894 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:08:56,894 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:08:56,902 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:08:56" (1/1) ... [2025-01-09 14:08:56,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:08:56" (1/1) ... [2025-01-09 14:08:56,904 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:08:56" (1/1) ... [2025-01-09 14:08:56,919 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 14:08:56,920 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:08:56" (1/1) ... [2025-01-09 14:08:56,920 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:08:56" (1/1) ... [2025-01-09 14:08:56,931 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:08:56" (1/1) ... [2025-01-09 14:08:56,932 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:08:56" (1/1) ... [2025-01-09 14:08:56,938 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:08:56" (1/1) ... [2025-01-09 14:08:56,940 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:08:56" (1/1) ... [2025-01-09 14:08:56,941 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:08:56" (1/1) ... [2025-01-09 14:08:56,945 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:08:56,947 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:08:56,949 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:08:56,949 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:08:56,950 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:08:56" (1/1) ... [2025-01-09 14:08:56,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:08:56,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:08:56,974 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 14:08:56,976 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 14:08:56,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:08:56,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 14:08:56,995 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:08:56,996 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:08:56,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:08:56,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:08:57,064 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:08:57,066 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:09:10,382 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2025-01-09 14:09:10,382 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:09:10,391 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:09:10,391 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:09:10,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:09:10 BoogieIcfgContainer [2025-01-09 14:09:10,392 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:09:10,393 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:09:10,393 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:09:10,397 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:09:10,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:08:56" (1/3) ... [2025-01-09 14:09:10,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c640ca0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:09:10, skipping insertion in model container [2025-01-09 14:09:10,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:08:56" (2/3) ... [2025-01-09 14:09:10,398 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c640ca0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:09:10, skipping insertion in model container [2025-01-09 14:09:10,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:09:10" (3/3) ... [2025-01-09 14:09:10,398 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-53.i [2025-01-09 14:09:10,408 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:09:10,410 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount100_file-53.i that has 2 procedures, 83 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:09:10,450 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:09:10,459 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;@2bb489bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:09:10,460 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:09:10,463 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 56 states have internal predecessors, (78), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-01-09 14:09:10,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 14:09:10,489 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:09:10,490 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:09:10,491 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:09:10,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:09:10,495 INFO L85 PathProgramCache]: Analyzing trace with hash -553814775, now seen corresponding path program 1 times [2025-01-09 14:09:10,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:09:10,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [942526424] [2025-01-09 14:09:10,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:09:10,505 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 14:09:10,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:09:10,507 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 14:09:10,508 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 14:09:10,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 14:09:11,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 14:09:11,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:09:11,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:09:11,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:09:11,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:09:11,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2025-01-09 14:09:11,340 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:09:11,340 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:09:11,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [942526424] [2025-01-09 14:09:11,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [942526424] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:09:11,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:09:11,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 14:09:11,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321742741] [2025-01-09 14:09:11,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:09:11,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:09:11,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:09:11,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:09:11,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:09:11,359 INFO L87 Difference]: Start difference. First operand has 83 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 56 states have internal predecessors, (78), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 14:09:11,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:09:11,381 INFO L93 Difference]: Finished difference Result 160 states and 276 transitions. [2025-01-09 14:09:11,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:09:11,383 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 166 [2025-01-09 14:09:11,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:09:11,387 INFO L225 Difference]: With dead ends: 160 [2025-01-09 14:09:11,387 INFO L226 Difference]: Without dead ends: 80 [2025-01-09 14:09:11,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 165 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 14:09:11,391 INFO L435 NwaCegarLoop]: 123 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, 123 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 14:09:11,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:09:11,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-01-09 14:09:11,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-01-09 14:09:11,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 53 states have internal predecessors, (73), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-01-09 14:09:11,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 123 transitions. [2025-01-09 14:09:11,429 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 123 transitions. Word has length 166 [2025-01-09 14:09:11,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:09:11,429 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 123 transitions. [2025-01-09 14:09:11,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 14:09:11,430 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 123 transitions. [2025-01-09 14:09:11,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 14:09:11,432 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:09:11,432 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:09:11,451 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 (2)] Ended with exit code 0 [2025-01-09 14:09:11,636 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 14:09:11,636 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:09:11,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:09:11,637 INFO L85 PathProgramCache]: Analyzing trace with hash 2084373507, now seen corresponding path program 1 times [2025-01-09 14:09:11,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:09:11,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [38560818] [2025-01-09 14:09:11,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:09:11,638 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 14:09:11,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:09:11,640 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 14:09:11,641 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 14:09:11,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 14:09:12,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 14:09:12,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:09:12,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:09:12,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 14:09:12,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:09:34,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 332 proven. 177 refuted. 0 times theorem prover too weak. 691 trivial. 0 not checked. [2025-01-09 14:09:34,351 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:09:36,118 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:09:36,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [38560818] [2025-01-09 14:09:36,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [38560818] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:09:36,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [386815087] [2025-01-09 14:09:36,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:09:36,119 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 14:09:36,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 14:09:36,122 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 14:09:36,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-01-09 14:09:36,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 14:09:38,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 14:09:38,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:09:38,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:09:38,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-09 14:09:38,803 INFO L279 TraceCheckSpWp]: Computing forward predicates...