./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-38.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-38.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c7afbbb4b2e6924bc13d55806a21ab7f087433beabc76695e33c51517c3d4e0b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:57:15,643 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:57:15,693 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 13:57:15,700 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:57:15,700 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:57:15,721 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:57:15,723 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:57:15,723 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:57:15,723 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:57:15,724 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:57:15,724 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:57:15,724 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:57:15,725 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:57:15,725 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:57:15,725 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:57:15,725 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:57:15,725 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:57:15,725 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:57:15,725 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 13:57:15,725 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:57:15,725 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:57:15,725 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:57:15,726 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:57:15,726 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:57:15,726 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:57:15,726 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:57:15,726 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:57:15,726 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:57:15,726 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:57:15,726 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:57:15,726 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:57:15,726 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:57:15,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:57:15,727 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:57:15,727 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:57:15,727 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:57:15,727 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:57:15,727 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 13:57:15,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 13:57:15,727 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:57:15,728 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:57:15,728 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:57:15,728 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:57:15,728 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c7afbbb4b2e6924bc13d55806a21ab7f087433beabc76695e33c51517c3d4e0b [2025-03-08 13:57:15,958 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:57:15,966 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:57:15,968 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:57:15,969 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:57:15,969 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:57:15,970 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-38.i [2025-03-08 13:57:17,164 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3d64789b/b433c41dd2594ba19165cb297c3d9a6a/FLAG5771dc149 [2025-03-08 13:57:17,423 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:57:17,424 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-38.i [2025-03-08 13:57:17,435 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3d64789b/b433c41dd2594ba19165cb297c3d9a6a/FLAG5771dc149 [2025-03-08 13:57:17,453 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3d64789b/b433c41dd2594ba19165cb297c3d9a6a [2025-03-08 13:57:17,455 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:57:17,456 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:57:17,457 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:57:17,458 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:57:17,461 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:57:17,462 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:57:17" (1/1) ... [2025-03-08 13:57:17,463 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e3f5dff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:17, skipping insertion in model container [2025-03-08 13:57:17,463 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:57:17" (1/1) ... [2025-03-08 13:57:17,483 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:57:17,594 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-38.i[916,929] [2025-03-08 13:57:17,673 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:57:17,689 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:57:17,696 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-38.i[916,929] [2025-03-08 13:57:17,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:57:17,752 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:57:17,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:17 WrapperNode [2025-03-08 13:57:17,753 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:57:17,754 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:57:17,754 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:57:17,755 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:57:17,759 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:17" (1/1) ... [2025-03-08 13:57:17,773 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:17" (1/1) ... [2025-03-08 13:57:17,809 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 170 [2025-03-08 13:57:17,811 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:57:17,814 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:57:17,814 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:57:17,814 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:57:17,823 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:17" (1/1) ... [2025-03-08 13:57:17,823 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:17" (1/1) ... [2025-03-08 13:57:17,827 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:17" (1/1) ... [2025-03-08 13:57:17,853 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 13:57:17,854 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:17" (1/1) ... [2025-03-08 13:57:17,854 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:17" (1/1) ... [2025-03-08 13:57:17,863 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:17" (1/1) ... [2025-03-08 13:57:17,868 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:17" (1/1) ... [2025-03-08 13:57:17,870 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:17" (1/1) ... [2025-03-08 13:57:17,874 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:17" (1/1) ... [2025-03-08 13:57:17,877 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:57:17,880 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:57:17,880 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:57:17,881 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:57:17,881 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:17" (1/1) ... [2025-03-08 13:57:17,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:57:17,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:57:17,907 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 13:57:17,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 13:57:17,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:57:17,927 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:57:17,927 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:57:17,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 13:57:17,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:57:17,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:57:17,983 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:57:17,985 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:57:18,312 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-03-08 13:57:18,312 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:57:18,323 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:57:18,323 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:57:18,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:57:18 BoogieIcfgContainer [2025-03-08 13:57:18,324 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:57:18,325 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:57:18,325 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:57:18,329 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:57:18,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:57:17" (1/3) ... [2025-03-08 13:57:18,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5252fd97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:57:18, skipping insertion in model container [2025-03-08 13:57:18,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:17" (2/3) ... [2025-03-08 13:57:18,331 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5252fd97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:57:18, skipping insertion in model container [2025-03-08 13:57:18,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:57:18" (3/3) ... [2025-03-08 13:57:18,333 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-38.i [2025-03-08 13:57:18,342 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:57:18,344 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-38.i that has 2 procedures, 67 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:57:18,390 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:57:18,398 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;@e99a48b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:57:18,400 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:57:18,404 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 49 states have internal predecessors, (73), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 13:57:18,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 13:57:18,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:57:18,411 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:57:18,412 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:57:18,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:57:18,417 INFO L85 PathProgramCache]: Analyzing trace with hash -67103748, now seen corresponding path program 1 times [2025-03-08 13:57:18,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:57:18,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520494540] [2025-03-08 13:57:18,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:57:18,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:57:18,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 13:57:18,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 13:57:18,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:57:18,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:57:18,678 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-08 13:57:18,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:57:18,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520494540] [2025-03-08 13:57:18,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520494540] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:57:18,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352191467] [2025-03-08 13:57:18,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:57:18,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:57:18,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:57:18,682 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 13:57:18,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 13:57:18,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 13:57:18,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 13:57:18,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:57:18,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:57:18,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:57:18,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:57:18,833 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-08 13:57:18,835 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:57:18,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352191467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:57:18,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 13:57:18,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 13:57:18,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135307998] [2025-03-08 13:57:18,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:57:18,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:57:18,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:57:18,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:57:18,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:57:18,857 INFO L87 Difference]: Start difference. First operand has 67 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 49 states have internal predecessors, (73), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 13:57:18,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:57:18,876 INFO L93 Difference]: Finished difference Result 131 states and 223 transitions. [2025-03-08 13:57:18,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:57:18,878 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 113 [2025-03-08 13:57:18,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:57:18,883 INFO L225 Difference]: With dead ends: 131 [2025-03-08 13:57:18,883 INFO L226 Difference]: Without dead ends: 64 [2025-03-08 13:57:18,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:57:18,887 INFO L435 NwaCegarLoop]: 103 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, 103 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:57:18,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:57:18,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-08 13:57:18,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-03-08 13:57:18,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 46 states have (on average 1.4782608695652173) internal successors, (68), 46 states have internal predecessors, (68), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 13:57:18,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 100 transitions. [2025-03-08 13:57:18,912 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 100 transitions. Word has length 113 [2025-03-08 13:57:18,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:57:18,912 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 100 transitions. [2025-03-08 13:57:18,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 13:57:18,912 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 100 transitions. [2025-03-08 13:57:18,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 13:57:18,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:57:18,915 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:57:18,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 13:57:19,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 13:57:19,116 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:57:19,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:57:19,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1792397466, now seen corresponding path program 1 times [2025-03-08 13:57:19,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:57:19,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041959001] [2025-03-08 13:57:19,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:57:19,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:57:19,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 13:57:19,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 13:57:19,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:57:19,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:57:19,658 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 13:57:19,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:57:19,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041959001] [2025-03-08 13:57:19,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041959001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:57:19,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:57:19,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 13:57:19,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654399864] [2025-03-08 13:57:19,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:57:19,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 13:57:19,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:57:19,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 13:57:19,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 13:57:19,663 INFO L87 Difference]: Start difference. First operand 64 states and 100 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 13:57:19,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:57:19,797 INFO L93 Difference]: Finished difference Result 257 states and 396 transitions. [2025-03-08 13:57:19,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 13:57:19,798 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 113 [2025-03-08 13:57:19,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:57:19,802 INFO L225 Difference]: With dead ends: 257 [2025-03-08 13:57:19,802 INFO L226 Difference]: Without dead ends: 196 [2025-03-08 13:57:19,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 13:57:19,805 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 211 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 13:57:19,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 425 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 13:57:19,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-03-08 13:57:19,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 102. [2025-03-08 13:57:19,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.4675324675324675) internal successors, (113), 78 states have internal predecessors, (113), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 13:57:19,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 157 transitions. [2025-03-08 13:57:19,828 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 157 transitions. Word has length 113 [2025-03-08 13:57:19,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:57:19,830 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 157 transitions. [2025-03-08 13:57:19,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 13:57:19,830 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 157 transitions. [2025-03-08 13:57:19,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 13:57:19,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:57:19,832 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:57:19,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 13:57:19,833 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:57:19,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:57:19,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1498994459, now seen corresponding path program 1 times [2025-03-08 13:57:19,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:57:19,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934574556] [2025-03-08 13:57:19,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:57:19,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:57:19,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 13:57:19,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 13:57:19,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:57:19,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:57:20,437 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 13:57:20,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:57:20,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934574556] [2025-03-08 13:57:20,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934574556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:57:20,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:57:20,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 13:57:20,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623696029] [2025-03-08 13:57:20,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:57:20,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 13:57:20,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:57:20,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 13:57:20,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 13:57:20,442 INFO L87 Difference]: Start difference. First operand 102 states and 157 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 13:57:20,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:57:20,731 INFO L93 Difference]: Finished difference Result 341 states and 530 transitions. [2025-03-08 13:57:20,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 13:57:20,732 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 113 [2025-03-08 13:57:20,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:57:20,735 INFO L225 Difference]: With dead ends: 341 [2025-03-08 13:57:20,735 INFO L226 Difference]: Without dead ends: 242 [2025-03-08 13:57:20,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2025-03-08 13:57:20,737 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 199 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 13:57:20,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 407 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 13:57:20,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-03-08 13:57:20,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 162. [2025-03-08 13:57:20,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 119 states have (on average 1.4369747899159664) internal successors, (171), 120 states have internal predecessors, (171), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-08 13:57:20,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 247 transitions. [2025-03-08 13:57:20,762 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 247 transitions. Word has length 113 [2025-03-08 13:57:20,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:57:20,763 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 247 transitions. [2025-03-08 13:57:20,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 13:57:20,763 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 247 transitions. [2025-03-08 13:57:20,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 13:57:20,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:57:20,765 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:57:20,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 13:57:20,765 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:57:20,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:57:20,765 INFO L85 PathProgramCache]: Analyzing trace with hash -614452303, now seen corresponding path program 1 times [2025-03-08 13:57:20,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:57:20,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128723067] [2025-03-08 13:57:20,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:57:20,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:57:20,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 13:57:20,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 13:57:20,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:57:20,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:57:20,861 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 13:57:20,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:57:20,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128723067] [2025-03-08 13:57:20,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128723067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:57:20,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:57:20,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 13:57:20,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339385801] [2025-03-08 13:57:20,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:57:20,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 13:57:20,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:57:20,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 13:57:20,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 13:57:20,864 INFO L87 Difference]: Start difference. First operand 162 states and 247 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 13:57:20,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:57:20,982 INFO L93 Difference]: Finished difference Result 374 states and 568 transitions. [2025-03-08 13:57:20,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 13:57:20,982 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 114 [2025-03-08 13:57:20,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:57:20,984 INFO L225 Difference]: With dead ends: 374 [2025-03-08 13:57:20,984 INFO L226 Difference]: Without dead ends: 268 [2025-03-08 13:57:20,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 13:57:20,985 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 191 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 13:57:20,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 398 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 13:57:20,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-03-08 13:57:21,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 182. [2025-03-08 13:57:21,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 139 states have (on average 1.3884892086330936) internal successors, (193), 140 states have internal predecessors, (193), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-08 13:57:21,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 269 transitions. [2025-03-08 13:57:21,017 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 269 transitions. Word has length 114 [2025-03-08 13:57:21,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:57:21,017 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 269 transitions. [2025-03-08 13:57:21,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 13:57:21,017 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 269 transitions. [2025-03-08 13:57:21,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 13:57:21,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:57:21,021 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:57:21,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 13:57:21,022 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:57:21,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:57:21,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1873060530, now seen corresponding path program 1 times [2025-03-08 13:57:21,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:57:21,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364923897] [2025-03-08 13:57:21,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:57:21,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:57:21,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 13:57:21,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 13:57:21,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:57:21,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:57:21,272 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 18 proven. 27 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-08 13:57:21,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:57:21,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364923897] [2025-03-08 13:57:21,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364923897] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:57:21,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753979482] [2025-03-08 13:57:21,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:57:21,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:57:21,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:57:21,275 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 13:57:21,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 13:57:21,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 13:57:21,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 13:57:21,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:57:21,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:57:21,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 13:57:21,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:57:21,479 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 249 proven. 18 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2025-03-08 13:57:21,481 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 13:57:21,634 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 27 proven. 18 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-08 13:57:21,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753979482] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 13:57:21,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 13:57:21,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-08 13:57:21,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799190173] [2025-03-08 13:57:21,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 13:57:21,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 13:57:21,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:57:21,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 13:57:21,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 13:57:21,637 INFO L87 Difference]: Start difference. First operand 182 states and 269 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2025-03-08 13:57:21,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:57:21,884 INFO L93 Difference]: Finished difference Result 292 states and 422 transitions. [2025-03-08 13:57:21,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 13:57:21,885 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) Word has length 114 [2025-03-08 13:57:21,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:57:21,887 INFO L225 Difference]: With dead ends: 292 [2025-03-08 13:57:21,888 INFO L226 Difference]: Without dead ends: 150 [2025-03-08 13:57:21,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 225 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2025-03-08 13:57:21,889 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 181 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 13:57:21,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 221 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 13:57:21,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-08 13:57:21,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 142. [2025-03-08 13:57:21,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 102 states have (on average 1.2843137254901962) internal successors, (131), 102 states have internal predecessors, (131), 32 states have call successors, (32), 7 states have call predecessors, (32), 7 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 13:57:21,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 195 transitions. [2025-03-08 13:57:21,902 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 195 transitions. Word has length 114 [2025-03-08 13:57:21,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:57:21,903 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 195 transitions. [2025-03-08 13:57:21,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2025-03-08 13:57:21,903 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 195 transitions. [2025-03-08 13:57:21,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-08 13:57:21,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:57:21,904 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:57:21,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 13:57:22,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:57:22,105 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:57:22,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:57:22,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1034013654, now seen corresponding path program 1 times [2025-03-08 13:57:22,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:57:22,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988297631] [2025-03-08 13:57:22,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:57:22,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:57:22,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 13:57:22,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 13:57:22,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:57:22,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:57:22,371 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 13:57:22,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:57:22,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988297631] [2025-03-08 13:57:22,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988297631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:57:22,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:57:22,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 13:57:22,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895630692] [2025-03-08 13:57:22,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:57:22,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 13:57:22,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:57:22,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 13:57:22,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 13:57:22,373 INFO L87 Difference]: Start difference. First operand 142 states and 195 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 13:57:22,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:57:22,482 INFO L93 Difference]: Finished difference Result 274 states and 375 transitions. [2025-03-08 13:57:22,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 13:57:22,483 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 115 [2025-03-08 13:57:22,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:57:22,484 INFO L225 Difference]: With dead ends: 274 [2025-03-08 13:57:22,484 INFO L226 Difference]: Without dead ends: 195 [2025-03-08 13:57:22,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 13:57:22,485 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 154 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 13:57:22,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 212 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 13:57:22,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-08 13:57:22,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 168. [2025-03-08 13:57:22,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 125 states have (on average 1.272) internal successors, (159), 125 states have internal predecessors, (159), 32 states have call successors, (32), 10 states have call predecessors, (32), 10 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 13:57:22,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 223 transitions. [2025-03-08 13:57:22,498 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 223 transitions. Word has length 115 [2025-03-08 13:57:22,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:57:22,498 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 223 transitions. [2025-03-08 13:57:22,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 13:57:22,499 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 223 transitions. [2025-03-08 13:57:22,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-08 13:57:22,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:57:22,500 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:57:22,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 13:57:22,500 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:57:22,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:57:22,500 INFO L85 PathProgramCache]: Analyzing trace with hash 418393875, now seen corresponding path program 1 times [2025-03-08 13:57:22,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:57:22,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466890338] [2025-03-08 13:57:22,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:57:22,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:57:22,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 13:57:22,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 13:57:22,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:57:22,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:57:23,136 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 13:57:23,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:57:23,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466890338] [2025-03-08 13:57:23,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466890338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:57:23,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:57:23,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 13:57:23,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951882687] [2025-03-08 13:57:23,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:57:23,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 13:57:23,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:57:23,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 13:57:23,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 13:57:23,139 INFO L87 Difference]: Start difference. First operand 168 states and 223 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 13:57:23,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:57:23,193 INFO L93 Difference]: Finished difference Result 282 states and 379 transitions. [2025-03-08 13:57:23,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 13:57:23,194 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 115 [2025-03-08 13:57:23,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:57:23,196 INFO L225 Difference]: With dead ends: 282 [2025-03-08 13:57:23,196 INFO L226 Difference]: Without dead ends: 168 [2025-03-08 13:57:23,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 13:57:23,198 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 138 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:57:23,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 173 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:57:23,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-08 13:57:23,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2025-03-08 13:57:23,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 125 states have (on average 1.256) internal successors, (157), 125 states have internal predecessors, (157), 32 states have call successors, (32), 10 states have call predecessors, (32), 10 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 13:57:23,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 221 transitions. [2025-03-08 13:57:23,217 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 221 transitions. Word has length 115 [2025-03-08 13:57:23,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:57:23,217 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 221 transitions. [2025-03-08 13:57:23,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 13:57:23,217 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 221 transitions. [2025-03-08 13:57:23,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-08 13:57:23,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:57:23,218 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:57:23,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 13:57:23,219 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:57:23,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:57:23,219 INFO L85 PathProgramCache]: Analyzing trace with hash -578678478, now seen corresponding path program 1 times [2025-03-08 13:57:23,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:57:23,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249151092] [2025-03-08 13:57:23,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:57:23,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:57:23,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 13:57:23,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 13:57:23,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:57:23,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:57:23,462 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-08 13:57:23,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:57:23,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249151092] [2025-03-08 13:57:23,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249151092] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:57:23,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2865486] [2025-03-08 13:57:23,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:57:23,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:57:23,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:57:23,465 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 13:57:23,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 13:57:23,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 13:57:23,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 13:57:23,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:57:23,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:57:23,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 13:57:23,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:57:23,746 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 45 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 13:57:23,747 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 13:57:24,128 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-08 13:57:24,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2865486] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 13:57:24,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 13:57:24,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-08 13:57:24,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60509733] [2025-03-08 13:57:24,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 13:57:24,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 13:57:24,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:57:24,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 13:57:24,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-08 13:57:24,130 INFO L87 Difference]: Start difference. First operand 168 states and 221 transitions. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 3 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 3 states have call successors, (47) [2025-03-08 13:57:24,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:57:24,644 INFO L93 Difference]: Finished difference Result 445 states and 575 transitions. [2025-03-08 13:57:24,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 13:57:24,645 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 3 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 3 states have call successors, (47) Word has length 115 [2025-03-08 13:57:24,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:57:24,647 INFO L225 Difference]: With dead ends: 445 [2025-03-08 13:57:24,647 INFO L226 Difference]: Without dead ends: 352 [2025-03-08 13:57:24,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=186, Invalid=414, Unknown=0, NotChecked=0, Total=600 [2025-03-08 13:57:24,647 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 273 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 13:57:24,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 424 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 13:57:24,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-03-08 13:57:24,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 180. [2025-03-08 13:57:24,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 135 states have (on average 1.2444444444444445) internal successors, (168), 135 states have internal predecessors, (168), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 13:57:24,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 232 transitions. [2025-03-08 13:57:24,673 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 232 transitions. Word has length 115 [2025-03-08 13:57:24,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:57:24,673 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 232 transitions. [2025-03-08 13:57:24,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 3 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 3 states have call successors, (47) [2025-03-08 13:57:24,673 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 232 transitions. [2025-03-08 13:57:24,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 13:57:24,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:57:24,674 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:57:24,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 13:57:24,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:57:24,875 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:57:24,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:57:24,875 INFO L85 PathProgramCache]: Analyzing trace with hash -726778858, now seen corresponding path program 1 times [2025-03-08 13:57:24,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:57:24,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004008552] [2025-03-08 13:57:24,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:57:24,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:57:24,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 13:57:24,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 13:57:24,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:57:24,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:57:24,947 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 13:57:24,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:57:24,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004008552] [2025-03-08 13:57:24,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004008552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:57:24,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:57:24,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 13:57:24,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225054073] [2025-03-08 13:57:24,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:57:24,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 13:57:24,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:57:24,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 13:57:24,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:57:24,948 INFO L87 Difference]: Start difference. First operand 180 states and 232 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 13:57:24,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:57:24,967 INFO L93 Difference]: Finished difference Result 281 states and 366 transitions. [2025-03-08 13:57:24,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 13:57:24,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2025-03-08 13:57:24,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:57:24,970 INFO L225 Difference]: With dead ends: 281 [2025-03-08 13:57:24,970 INFO L226 Difference]: Without dead ends: 180 [2025-03-08 13:57:24,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:57:24,970 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 48 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:57:24,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 92 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:57:24,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-08 13:57:24,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2025-03-08 13:57:24,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 135 states have (on average 1.237037037037037) internal successors, (167), 135 states have internal predecessors, (167), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 13:57:24,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 231 transitions. [2025-03-08 13:57:24,985 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 231 transitions. Word has length 116 [2025-03-08 13:57:24,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:57:24,985 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 231 transitions. [2025-03-08 13:57:24,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 13:57:24,985 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 231 transitions. [2025-03-08 13:57:24,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 13:57:24,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:57:24,986 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:57:24,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 13:57:24,986 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:57:24,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:57:24,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1685627576, now seen corresponding path program 1 times [2025-03-08 13:57:24,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:57:24,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652247296] [2025-03-08 13:57:24,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:57:24,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:57:24,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 13:57:25,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 13:57:25,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:57:25,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:57:25,340 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-08 13:57:25,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:57:25,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652247296] [2025-03-08 13:57:25,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652247296] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:57:25,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769755653] [2025-03-08 13:57:25,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:57:25,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:57:25,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:57:25,343 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 13:57:25,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 13:57:25,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 13:57:25,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 13:57:25,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:57:25,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:57:25,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 13:57:25,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:57:25,643 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 45 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 13:57:25,643 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 13:57:25,868 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-08 13:57:25,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769755653] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 13:57:25,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 13:57:25,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-08 13:57:25,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024699105] [2025-03-08 13:57:25,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 13:57:25,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 13:57:25,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:57:25,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 13:57:25,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-08 13:57:25,870 INFO L87 Difference]: Start difference. First operand 180 states and 231 transitions. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 3 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 3 states have call successors, (47) [2025-03-08 13:57:26,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:57:26,676 INFO L93 Difference]: Finished difference Result 521 states and 666 transitions. [2025-03-08 13:57:26,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-08 13:57:26,677 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 3 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 3 states have call successors, (47) Word has length 116 [2025-03-08 13:57:26,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:57:26,679 INFO L225 Difference]: With dead ends: 521 [2025-03-08 13:57:26,679 INFO L226 Difference]: Without dead ends: 420 [2025-03-08 13:57:26,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=245, Invalid=625, Unknown=0, NotChecked=0, Total=870 [2025-03-08 13:57:26,680 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 273 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 13:57:26,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 557 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 13:57:26,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2025-03-08 13:57:26,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 189. [2025-03-08 13:57:26,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 144 states have (on average 1.2569444444444444) internal successors, (181), 144 states have internal predecessors, (181), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 13:57:26,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 245 transitions. [2025-03-08 13:57:26,702 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 245 transitions. Word has length 116 [2025-03-08 13:57:26,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:57:26,703 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 245 transitions. [2025-03-08 13:57:26,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 3 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 3 states have call successors, (47) [2025-03-08 13:57:26,704 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 245 transitions. [2025-03-08 13:57:26,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 13:57:26,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:57:26,704 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:57:26,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 13:57:26,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:57:26,910 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:57:26,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:57:26,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1180068951, now seen corresponding path program 1 times [2025-03-08 13:57:26,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:57:26,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356227845] [2025-03-08 13:57:26,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:57:26,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:57:26,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 13:57:26,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 13:57:26,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:57:26,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:57:26,963 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 13:57:26,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:57:26,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356227845] [2025-03-08 13:57:26,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356227845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:57:26,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:57:26,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 13:57:26,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176362394] [2025-03-08 13:57:26,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:57:26,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 13:57:26,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:57:26,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 13:57:26,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:57:26,965 INFO L87 Difference]: Start difference. First operand 189 states and 245 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 13:57:27,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:57:27,000 INFO L93 Difference]: Finished difference Result 378 states and 487 transitions. [2025-03-08 13:57:27,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 13:57:27,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2025-03-08 13:57:27,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:57:27,003 INFO L225 Difference]: With dead ends: 378 [2025-03-08 13:57:27,003 INFO L226 Difference]: Without dead ends: 266 [2025-03-08 13:57:27,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:57:27,004 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 85 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:57:27,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 185 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:57:27,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-08 13:57:27,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 185. [2025-03-08 13:57:27,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 140 states have (on average 1.2214285714285715) internal successors, (171), 140 states have internal predecessors, (171), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 13:57:27,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 235 transitions. [2025-03-08 13:57:27,025 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 235 transitions. Word has length 116 [2025-03-08 13:57:27,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:57:27,025 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 235 transitions. [2025-03-08 13:57:27,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 13:57:27,025 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 235 transitions. [2025-03-08 13:57:27,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 13:57:27,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:57:27,026 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:57:27,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 13:57:27,026 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:57:27,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:57:27,026 INFO L85 PathProgramCache]: Analyzing trace with hash 669534774, now seen corresponding path program 1 times [2025-03-08 13:57:27,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:57:27,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336289447] [2025-03-08 13:57:27,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:57:27,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:57:27,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 13:57:27,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 13:57:27,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:57:27,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:57:27,187 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 13:57:27,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:57:27,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336289447] [2025-03-08 13:57:27,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336289447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:57:27,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:57:27,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 13:57:27,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513357459] [2025-03-08 13:57:27,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:57:27,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 13:57:27,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:57:27,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 13:57:27,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 13:57:27,191 INFO L87 Difference]: Start difference. First operand 185 states and 235 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 13:57:27,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:57:27,226 INFO L93 Difference]: Finished difference Result 282 states and 361 transitions. [2025-03-08 13:57:27,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 13:57:27,227 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2025-03-08 13:57:27,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:57:27,228 INFO L225 Difference]: With dead ends: 282 [2025-03-08 13:57:27,228 INFO L226 Difference]: Without dead ends: 168 [2025-03-08 13:57:27,229 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-03-08 13:57:27,229 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 48 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:57:27,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 218 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:57:27,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-08 13:57:27,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2025-03-08 13:57:27,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 123 states have (on average 1.1788617886178863) internal successors, (145), 123 states have internal predecessors, (145), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 13:57:27,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 209 transitions. [2025-03-08 13:57:27,250 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 209 transitions. Word has length 116 [2025-03-08 13:57:27,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:57:27,253 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 209 transitions. [2025-03-08 13:57:27,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 13:57:27,253 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 209 transitions. [2025-03-08 13:57:27,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-08 13:57:27,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:57:27,255 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:57:27,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 13:57:27,255 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:57:27,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:57:27,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1082952207, now seen corresponding path program 1 times [2025-03-08 13:57:27,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:57:27,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305402606] [2025-03-08 13:57:27,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:57:27,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:57:27,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 13:57:27,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 13:57:27,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:57:27,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 13:57:27,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1186821312] [2025-03-08 13:57:27,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:57:27,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:57:27,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:57:27,313 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 13:57:27,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 13:57:27,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 13:57:27,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 13:57:27,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:57:27,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:57:27,655 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 13:57:27,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 13:57:27,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 13:57:27,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:57:27,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:57:27,753 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 13:57:27,753 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 13:57:27,754 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 13:57:27,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 13:57:27,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 13:57:27,960 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:57:28,034 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 13:57:28,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 01:57:28 BoogieIcfgContainer [2025-03-08 13:57:28,036 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 13:57:28,036 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 13:57:28,036 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 13:57:28,037 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 13:57:28,037 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:57:18" (3/4) ... [2025-03-08 13:57:28,039 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 13:57:28,040 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 13:57:28,040 INFO L158 Benchmark]: Toolchain (without parser) took 10584.08ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 105.9MB in the beginning and 190.7MB in the end (delta: -84.8MB). Peak memory consumption was 114.0MB. Max. memory is 16.1GB. [2025-03-08 13:57:28,040 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:57:28,041 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.07ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 89.8MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 13:57:28,041 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.44ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 84.7MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 13:57:28,041 INFO L158 Benchmark]: Boogie Preprocessor took 65.26ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 75.0MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 13:57:28,041 INFO L158 Benchmark]: IcfgBuilder took 443.84ms. Allocated memory is still 142.6MB. Free memory was 75.0MB in the beginning and 47.8MB in the end (delta: 27.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 13:57:28,041 INFO L158 Benchmark]: TraceAbstraction took 9710.58ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 46.7MB in the beginning and 190.8MB in the end (delta: -144.1MB). Peak memory consumption was 55.3MB. Max. memory is 16.1GB. [2025-03-08 13:57:28,041 INFO L158 Benchmark]: Witness Printer took 3.52ms. Allocated memory is still 343.9MB. Free memory was 190.8MB in the beginning and 190.7MB in the end (delta: 106.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:57:28,043 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.31ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 296.07ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 89.8MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.44ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 84.7MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.26ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 75.0MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 443.84ms. Allocated memory is still 142.6MB. Free memory was 75.0MB in the beginning and 47.8MB in the end (delta: 27.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9710.58ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 46.7MB in the beginning and 190.8MB in the end (delta: -144.1MB). Peak memory consumption was 55.3MB. Max. memory is 16.1GB. * Witness Printer took 3.52ms. Allocated memory is still 343.9MB. Free memory was 190.8MB in the beginning and 190.7MB in the end (delta: 106.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 153, overapproximation of someBinaryFLOATComparisonOperation at line 89, overapproximation of someBinaryFLOATComparisonOperation at line 99, overapproximation of someBinaryFLOATComparisonOperation at line 129, overapproximation of someBinaryFLOATComparisonOperation at line 179, overapproximation of someBinaryFLOATComparisonOperation at line 106, overapproximation of someBinaryFLOATComparisonOperation at line 151, overapproximation of someBinaryDOUBLEComparisonOperation at line 133, overapproximation of someBinaryDOUBLEComparisonOperation at line 57, overapproximation of someBinaryDOUBLEComparisonOperation at line 179, overapproximation of someBinaryDOUBLEComparisonOperation at line 149, overapproximation of someBinaryDOUBLEComparisonOperation at line 148, overapproximation of someBinaryArithmeticFLOAToperation at line 134, overapproximation of someBinaryArithmeticFLOAToperation at line 129. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 200; [L23] unsigned short int var_1_5 = 42139; [L24] unsigned short int var_1_7 = 1; [L25] double var_1_9 = 0.1; [L26] float var_1_12 = 10000000000.5; [L27] float var_1_13 = 255.6; [L28] float var_1_14 = 128.2; [L29] signed long int var_1_15 = 500; [L30] unsigned char var_1_16 = 0; [L31] unsigned char var_1_17 = 0; [L32] unsigned char var_1_18 = 0; [L33] signed char var_1_19 = -5; [L34] signed char var_1_20 = -1; [L35] signed char var_1_21 = 8; [L36] float var_1_22 = 3.75; [L37] signed short int var_1_23 = 10; [L38] unsigned long int var_1_24 = 8; [L39] unsigned char var_1_25 = 5; [L40] unsigned char var_1_26 = 50; [L41] float var_1_27 = 4.5; [L42] unsigned short int var_1_28 = 5; [L43] unsigned long int var_1_29 = 50; [L44] double var_1_30 = 3.5; [L45] unsigned char var_1_31 = 1; [L46] float last_1_var_1_12 = 10000000000.5; [L47] signed short int last_1_var_1_23 = 10; [L48] unsigned long int last_1_var_1_24 = 8; [L49] unsigned char last_1_var_1_25 = 5; [L50] unsigned long int last_1_var_1_29 = 50; [L51] unsigned char last_1_var_1_31 = 1; VAL [isInitial=0, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=42139, var_1_7=1, var_1_9=1/10] [L183] isInitial = 1 [L184] FCALL initially() [L185] int k_loop; [L186] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=42139, var_1_7=1, var_1_9=1/10] [L186] COND TRUE k_loop < 1 [L187] CALL updateLastVariables() [L171] last_1_var_1_12 = var_1_12 [L172] last_1_var_1_23 = var_1_23 [L173] last_1_var_1_24 = var_1_24 [L174] last_1_var_1_25 = var_1_25 [L175] last_1_var_1_29 = var_1_29 [L176] last_1_var_1_31 = var_1_31 VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=42139, var_1_7=1, var_1_9=1/10] [L187] RET updateLastVariables() [L188] CALL updateVariables() [L144] var_1_5 = __VERIFIER_nondet_ushort() [L145] CALL assume_abort_if_not(var_1_5 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=-32769, var_1_7=1, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=-32769, var_1_7=1, var_1_9=1/10] [L145] RET assume_abort_if_not(var_1_5 >= 32767) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=-32769, var_1_7=1, var_1_9=1/10] [L146] CALL assume_abort_if_not(var_1_5 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=-32769, var_1_7=1, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=-32769, var_1_7=1, var_1_9=1/10] [L146] RET assume_abort_if_not(var_1_5 <= 65534) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=-32769, var_1_7=1, var_1_9=1/10] [L147] var_1_9 = __VERIFIER_nondet_double() [L148] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=-32769, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=-32769, var_1_7=1] [L148] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=-32769, var_1_7=1] [L149] CALL assume_abort_if_not(var_1_9 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=-32769, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=-32769, var_1_7=1] [L149] RET assume_abort_if_not(var_1_9 != 0.0F) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=-32769, var_1_7=1] [L150] var_1_13 = __VERIFIER_nondet_float() [L151] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=-32769, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=-32769, var_1_7=1] [L151] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=-32769, var_1_7=1] [L152] var_1_14 = __VERIFIER_nondet_float() [L153] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=-32769, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=-32769, var_1_7=1] [L153] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=-32769, var_1_7=1] [L154] var_1_17 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=-32769, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=-32769, var_1_7=1] [L155] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=-32769, var_1_7=1] [L156] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=-32769, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=-32769, var_1_7=1] [L156] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=-32769, var_1_7=1] [L157] var_1_18 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=-32769, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=-32769, var_1_7=1] [L158] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=-32769, var_1_7=1] [L159] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=-32769, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=-32769, var_1_7=1] [L159] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=-32769, var_1_7=1] [L160] var_1_20 = __VERIFIER_nondet_char() [L161] CALL assume_abort_if_not(var_1_20 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=-32769, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=-32769, var_1_7=1] [L161] RET assume_abort_if_not(var_1_20 >= -127) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=-32769, var_1_7=1] [L162] CALL assume_abort_if_not(var_1_20 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=-32769, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=-32769, var_1_7=1] [L162] RET assume_abort_if_not(var_1_20 <= 126) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=-32769, var_1_7=1] [L163] var_1_21 = __VERIFIER_nondet_char() [L164] CALL assume_abort_if_not(var_1_21 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=-32769, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=-32769, var_1_7=1] [L164] RET assume_abort_if_not(var_1_21 >= -127) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=-32769, var_1_7=1] [L165] CALL assume_abort_if_not(var_1_21 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=-32769, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=-32769, var_1_7=1] [L165] RET assume_abort_if_not(var_1_21 <= 126) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=-32769, var_1_7=1] [L166] var_1_26 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=-32769, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=-32769, var_1_7=1] [L167] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=-32769, var_1_7=1] [L168] CALL assume_abort_if_not(var_1_26 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=-32769, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=-32769, var_1_7=1] [L168] RET assume_abort_if_not(var_1_26 <= 254) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=-32769, var_1_7=1] [L188] RET updateVariables() [L189] CALL step() [L55] unsigned short int stepLocal_1 = var_1_5; [L56] unsigned long int stepLocal_0 = (last_1_var_1_25 + last_1_var_1_23) + (last_1_var_1_29 / var_1_5); VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=-32769, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=-32769, var_1_7=1] [L57] COND FALSE !((last_1_var_1_12 / var_1_9) != last_1_var_1_12) [L76] var_1_7 = var_1_5 VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=-32769, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=-32769, var_1_7=-32769] [L78] COND FALSE !(\read(var_1_18)) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=-32769, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=-32769, var_1_7=-32769] [L81] COND TRUE \read(var_1_17) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=-32769, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=-32769, var_1_7=-32769] [L82] COND FALSE !(((((var_1_29) > (var_1_5)) ? (var_1_29) : (var_1_5))) < ((((4) < 0 ) ? -(4) : (4)))) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=-32769, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=-32769, var_1_7=-32769] [L86] var_1_19 = ((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21))) [L87] var_1_30 = var_1_14 [L88] var_1_31 = var_1_17 VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=-32769, var_1_12=20000000001/2, var_1_14=2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=-32769, var_1_7=-32769] [L89] COND FALSE !(var_1_13 != 4.5f) [L96] var_1_16 = (var_1_18 || (! var_1_17)) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=-32769, var_1_12=20000000001/2, var_1_14=2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=-32769, var_1_7=-32769] [L98] COND TRUE var_1_16 || var_1_17 [L99] var_1_22 = ((((var_1_14) > (var_1_13)) ? (var_1_14) : (var_1_13))) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=-32769, var_1_12=20000000001/2, var_1_13=0, var_1_14=2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=-32769, var_1_7=-32769] [L101] COND TRUE \read(var_1_31) [L102] var_1_25 = (4 + 8) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=-32769, var_1_12=20000000001/2, var_1_13=0, var_1_14=2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=8, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=-32769, var_1_7=-32769] [L106] COND TRUE var_1_13 != var_1_22 [L107] var_1_28 = var_1_25 VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=-32769, var_1_12=20000000001/2, var_1_13=0, var_1_14=2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=8, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=-32769, var_1_7=-32769] [L111] COND FALSE !(\read(var_1_16)) [L114] var_1_1 = (((((var_1_5 - var_1_25)) < ((var_1_25 + (256 + 1)))) ? ((var_1_5 - var_1_25)) : ((var_1_25 + (256 + 1))))) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=-32769, var_1_12=20000000001/2, var_1_13=0, var_1_14=2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=8, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=-32769, var_1_7=-32769] [L116] unsigned short int stepLocal_3 = var_1_5; VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=-32769, stepLocal_3=-32769, var_1_12=20000000001/2, var_1_13=0, var_1_14=2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=8, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=-32769, var_1_7=-32769] [L117] COND TRUE stepLocal_3 >= ((((var_1_25) < (var_1_7)) ? (var_1_25) : (var_1_7))) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=-32769, var_1_12=20000000001/2, var_1_13=0, var_1_14=2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=8, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=-32769, var_1_7=-32769] [L118] COND TRUE ! var_1_16 [L119] var_1_15 = var_1_25 VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=-32769, var_1_12=20000000001/2, var_1_13=0, var_1_14=2, var_1_15=12, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=8, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=-32769, var_1_7=-32769] [L122] COND FALSE !(var_1_16 || var_1_18) [L125] var_1_24 = ((((2u) > (100u)) ? (2u) : (100u))) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=-32769, var_1_12=20000000001/2, var_1_13=0, var_1_14=2, var_1_15=12, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=100, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=-32769, var_1_7=-32769] [L127] signed long int stepLocal_2 = ((((-64) < (var_1_28)) ? (-64) : (var_1_28))) + (var_1_25 << 1); VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=-32769, stepLocal_2=-40, var_1_12=20000000001/2, var_1_13=0, var_1_14=2, var_1_15=12, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=100, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=-32769, var_1_7=-32769] [L128] COND TRUE stepLocal_2 < var_1_7 [L129] var_1_12 = (((((var_1_13 - 128.9f)) < (var_1_14)) ? ((var_1_13 - 128.9f)) : (var_1_14))) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=-32769, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=12, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=100, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=-32769, var_1_7=-32769] [L131] COND TRUE var_1_1 != var_1_25 VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=-32769, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=12, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=100, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=-32769, var_1_7=-32769] [L132] COND TRUE var_1_23 >= -128 VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=-32769, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=12, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=100, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=-32769, var_1_7=-32769] [L133] COND TRUE var_1_30 != ((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12))) [L134] var_1_27 = (var_1_13 - (99999.4f + 9.999999999125E9f)) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=-32769, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=12, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=100, var_1_25=12, var_1_26=0, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=-32769, var_1_7=-32769] [L189] RET step() [L190] CALL, EXPR property() [L179-L180] return ((((((((((((((var_1_16 ? (var_1_1 == ((unsigned short int) (((((var_1_25 + var_1_25)) < ((var_1_5 - ((((var_1_25) < 0 ) ? -(var_1_25) : (var_1_25)))))) ? ((var_1_25 + var_1_25)) : ((var_1_5 - ((((var_1_25) < 0 ) ? -(var_1_25) : (var_1_25))))))))) : (var_1_1 == ((unsigned short int) (((((var_1_5 - var_1_25)) < ((var_1_25 + (256 + 1)))) ? ((var_1_5 - var_1_25)) : ((var_1_25 + (256 + 1)))))))) && (((last_1_var_1_12 / var_1_9) != last_1_var_1_12) ? ((var_1_9 >= last_1_var_1_12) ? (var_1_7 == ((unsigned short int) last_1_var_1_25)) : ((var_1_5 <= last_1_var_1_25) ? ((last_1_var_1_25 < ((last_1_var_1_25 + last_1_var_1_23) + (last_1_var_1_29 / var_1_5))) ? (last_1_var_1_31 ? (var_1_7 == ((unsigned short int) 5)) : (var_1_7 == ((unsigned short int) last_1_var_1_25))) : (var_1_7 == ((unsigned short int) last_1_var_1_25))) : (var_1_7 == ((unsigned short int) last_1_var_1_25)))) : (var_1_7 == ((unsigned short int) var_1_5)))) && (((((((-64) < (var_1_28)) ? (-64) : (var_1_28))) + (var_1_25 << 1)) < var_1_7) ? (var_1_12 == ((float) (((((var_1_13 - 128.9f)) < (var_1_14)) ? ((var_1_13 - 128.9f)) : (var_1_14))))) : 1)) && ((var_1_5 >= ((((var_1_25) < (var_1_7)) ? (var_1_25) : (var_1_7)))) ? ((! var_1_16) ? (var_1_15 == ((signed long int) var_1_25)) : 1) : 1)) && ((var_1_13 != 4.5f) ? (var_1_31 ? (var_1_16 == ((unsigned char) var_1_17)) : (var_1_16 == ((unsigned char) (! 0)))) : (var_1_16 == ((unsigned char) (var_1_18 || (! var_1_17)))))) && (var_1_19 == ((signed char) ((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21)))))) && ((var_1_16 || var_1_17) ? (var_1_22 == ((float) ((((var_1_14) > (var_1_13)) ? (var_1_14) : (var_1_13))))) : 1)) && (var_1_17 ? ((((((var_1_29) > (var_1_5)) ? (var_1_29) : (var_1_5))) < ((((4) < 0 ) ? -(4) : (4)))) ? (var_1_23 == ((signed short int) var_1_20)) : 1) : 1)) && ((var_1_16 || var_1_18) ? (var_1_24 == ((unsigned long int) ((((last_1_var_1_24) > (var_1_25)) ? (last_1_var_1_24) : (var_1_25))))) : (var_1_24 == ((unsigned long int) ((((2u) > (100u)) ? (2u) : (100u))))))) && (var_1_31 ? (var_1_25 == ((unsigned char) (4 + 8))) : (var_1_25 == ((unsigned char) ((((var_1_26) < 0 ) ? -(var_1_26) : (var_1_26))))))) && ((var_1_1 != var_1_25) ? ((var_1_23 >= -128) ? ((var_1_30 != ((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))) ? (var_1_27 == ((float) (var_1_13 - (99999.4f + 9.999999999125E9f)))) : (var_1_27 == ((float) ((((0.8f) > (var_1_13)) ? (0.8f) : (var_1_13)))))) : 1) : (var_1_27 == ((float) var_1_14)))) && ((var_1_13 != var_1_22) ? (var_1_28 == ((unsigned short int) var_1_25)) : (var_1_28 == ((unsigned short int) (var_1_5 - 10))))) && (var_1_18 ? (var_1_29 == ((unsigned long int) (((((var_1_7 + 100000000u)) > (var_1_26)) ? ((var_1_7 + 100000000u)) : (var_1_26))))) : 1)) && (var_1_30 == ((double) var_1_14))) && (var_1_31 == ((unsigned char) var_1_17)) ; VAL [\result=0, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=12, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=100, var_1_25=12, var_1_26=0, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=-32769, var_1_7=-32769] [L190] RET, EXPR property() [L190] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=12, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=100, var_1_25=12, var_1_26=0, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=-32769, var_1_7=-32769] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=12, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=100, var_1_25=12, var_1_26=0, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=-32769, var_1_7=-32769] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 67 locations, 121 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.6s, OverallIterations: 13, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1840 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1801 mSDsluCounter, 3415 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2073 mSDsCounter, 256 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1480 IncrementalHoareTripleChecker+Invalid, 1736 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 256 mSolverCounterUnsat, 1342 mSDtfsCounter, 1480 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 921 GetRequests, 829 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=189occurred in iteration=10, 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, 12 MinimizatonAttempts, 779 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 2068 NumberOfCodeBlocks, 2068 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 2160 ConstructedInterpolants, 0 QuantifiedInterpolants, 5847 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1274 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 19 InterpolantComputations, 9 PerfectInterpolantSequences, 8757/9120 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 13:57:28,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-38.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c7afbbb4b2e6924bc13d55806a21ab7f087433beabc76695e33c51517c3d4e0b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:57:29,878 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:57:29,960 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 13:57:29,965 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:57:29,965 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:57:29,979 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:57:29,980 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:57:29,980 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:57:29,980 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:57:29,980 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:57:29,980 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:57:29,981 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:57:29,981 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:57:29,981 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:57:29,981 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:57:29,981 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:57:29,981 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:57:29,981 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:57:29,981 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:57:29,981 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:57:29,982 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:57:29,982 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:57:29,982 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:57:29,982 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 13:57:29,982 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 13:57:29,982 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 13:57:29,982 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:57:29,982 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:57:29,982 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:57:29,982 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:57:29,982 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:57:29,983 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:57:29,983 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:57:29,983 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:57:29,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:57:29,983 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:57:29,983 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:57:29,983 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:57:29,983 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:57:29,983 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 13:57:29,983 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 13:57:29,983 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:57:29,984 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:57:29,984 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:57:29,984 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:57:29,984 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c7afbbb4b2e6924bc13d55806a21ab7f087433beabc76695e33c51517c3d4e0b [2025-03-08 13:57:30,240 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:57:30,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:57:30,250 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:57:30,251 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:57:30,252 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:57:30,252 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-38.i [2025-03-08 13:57:31,431 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2277fa5ab/bbc19b20da04491e8d0bce061f8bbae5/FLAG175d4b214 [2025-03-08 13:57:31,645 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:57:31,645 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-38.i [2025-03-08 13:57:31,655 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2277fa5ab/bbc19b20da04491e8d0bce061f8bbae5/FLAG175d4b214 [2025-03-08 13:57:31,990 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2277fa5ab/bbc19b20da04491e8d0bce061f8bbae5 [2025-03-08 13:57:31,992 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:57:31,993 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:57:31,994 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:57:31,994 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:57:31,997 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:57:31,997 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:57:31" (1/1) ... [2025-03-08 13:57:31,998 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c10cd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:31, skipping insertion in model container [2025-03-08 13:57:31,998 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:57:31" (1/1) ... [2025-03-08 13:57:32,010 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:57:32,095 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-38.i[916,929] [2025-03-08 13:57:32,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:57:32,175 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:57:32,183 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-38.i[916,929] [2025-03-08 13:57:32,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:57:32,234 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:57:32,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:32 WrapperNode [2025-03-08 13:57:32,236 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:57:32,237 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:57:32,237 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:57:32,237 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:57:32,244 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:32" (1/1) ... [2025-03-08 13:57:32,254 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:32" (1/1) ... [2025-03-08 13:57:32,281 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 168 [2025-03-08 13:57:32,282 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:57:32,282 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:57:32,282 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:57:32,282 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:57:32,288 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:32" (1/1) ... [2025-03-08 13:57:32,288 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:32" (1/1) ... [2025-03-08 13:57:32,292 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:32" (1/1) ... [2025-03-08 13:57:32,302 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 13:57:32,303 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:32" (1/1) ... [2025-03-08 13:57:32,303 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:32" (1/1) ... [2025-03-08 13:57:32,310 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:32" (1/1) ... [2025-03-08 13:57:32,311 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:32" (1/1) ... [2025-03-08 13:57:32,312 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:32" (1/1) ... [2025-03-08 13:57:32,313 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:32" (1/1) ... [2025-03-08 13:57:32,322 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:57:32,323 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:57:32,323 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:57:32,323 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:57:32,324 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:32" (1/1) ... [2025-03-08 13:57:32,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:57:32,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:57:32,358 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 13:57:32,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 13:57:32,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:57:32,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 13:57:32,378 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:57:32,378 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:57:32,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:57:32,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:57:32,448 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:57:32,449 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:57:46,982 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-03-08 13:57:46,982 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:57:46,989 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:57:46,989 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:57:46,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:57:46 BoogieIcfgContainer [2025-03-08 13:57:46,989 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:57:46,991 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:57:46,991 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:57:46,995 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:57:46,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:57:31" (1/3) ... [2025-03-08 13:57:46,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72f21b03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:57:46, skipping insertion in model container [2025-03-08 13:57:46,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:57:32" (2/3) ... [2025-03-08 13:57:46,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72f21b03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:57:46, skipping insertion in model container [2025-03-08 13:57:46,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:57:46" (3/3) ... [2025-03-08 13:57:46,998 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-38.i [2025-03-08 13:57:47,009 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:57:47,011 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-38.i that has 2 procedures, 67 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:57:47,055 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:57:47,063 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;@7ce1a015, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:57:47,063 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:57:47,066 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 49 states have internal predecessors, (73), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 13:57:47,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 13:57:47,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:57:47,073 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:57:47,073 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:57:47,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:57:47,077 INFO L85 PathProgramCache]: Analyzing trace with hash -67103748, now seen corresponding path program 1 times [2025-03-08 13:57:47,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:57:47,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [22085679] [2025-03-08 13:57:47,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:57:47,085 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:57:47,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:57:47,088 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 13:57:47,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 13:57:47,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 13:57:47,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 13:57:47,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:57:47,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:57:47,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:57:47,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:57:47,998 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2025-03-08 13:57:47,998 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:57:47,999 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:57:47,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [22085679] [2025-03-08 13:57:47,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [22085679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:57:47,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:57:47,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 13:57:48,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6267191] [2025-03-08 13:57:48,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:57:48,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:57:48,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:57:48,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:57:48,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:57:48,023 INFO L87 Difference]: Start difference. First operand has 67 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 49 states have internal predecessors, (73), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 13:57:48,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:57:48,040 INFO L93 Difference]: Finished difference Result 131 states and 223 transitions. [2025-03-08 13:57:48,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:57:48,041 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 113 [2025-03-08 13:57:48,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:57:48,045 INFO L225 Difference]: With dead ends: 131 [2025-03-08 13:57:48,045 INFO L226 Difference]: Without dead ends: 64 [2025-03-08 13:57:48,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:57:48,049 INFO L435 NwaCegarLoop]: 103 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, 103 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:57:48,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:57:48,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-08 13:57:48,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-03-08 13:57:48,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 46 states have (on average 1.4782608695652173) internal successors, (68), 46 states have internal predecessors, (68), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 13:57:48,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 100 transitions. [2025-03-08 13:57:48,082 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 100 transitions. Word has length 113 [2025-03-08 13:57:48,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:57:48,083 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 100 transitions. [2025-03-08 13:57:48,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 13:57:48,083 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 100 transitions. [2025-03-08 13:57:48,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 13:57:48,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:57:48,088 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:57:48,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 13:57:48,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:57:48,289 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:57:48,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:57:48,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1792397466, now seen corresponding path program 1 times [2025-03-08 13:57:48,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:57:48,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [763055171] [2025-03-08 13:57:48,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:57:48,290 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:57:48,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:57:48,292 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 13:57:48,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 13:57:48,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 13:57:49,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 13:57:49,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:57:49,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:57:49,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 13:57:49,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:57:50,696 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 249 proven. 18 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2025-03-08 13:57:50,696 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 13:57:53,102 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 27 proven. 18 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-08 13:57:53,103 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:57:53,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [763055171] [2025-03-08 13:57:53,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [763055171] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 13:57:53,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 13:57:53,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-08 13:57:53,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107062013] [2025-03-08 13:57:53,104 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 13:57:53,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 13:57:53,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:57:53,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 13:57:53,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 13:57:53,106 INFO L87 Difference]: Start difference. First operand 64 states and 100 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 13:57:59,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:58:03,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:58:07,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:58:07,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:58:07,858 INFO L93 Difference]: Finished difference Result 133 states and 204 transitions. [2025-03-08 13:58:08,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 13:58:08,027 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 113 [2025-03-08 13:58:08,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:58:08,028 INFO L225 Difference]: With dead ends: 133 [2025-03-08 13:58:08,028 INFO L226 Difference]: Without dead ends: 72 [2025-03-08 13:58:08,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 218 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-08 13:58:08,029 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 66 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 3 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.2s IncrementalHoareTripleChecker+Time [2025-03-08 13:58:08,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 197 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 109 Invalid, 3 Unknown, 0 Unchecked, 14.2s Time] [2025-03-08 13:58:08,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-08 13:58:08,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2025-03-08 13:58:08,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 49 states have internal predecessors, (70), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 13:58:08,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 102 transitions. [2025-03-08 13:58:08,037 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 102 transitions. Word has length 113 [2025-03-08 13:58:08,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:58:08,038 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 102 transitions. [2025-03-08 13:58:08,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 13:58:08,038 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 102 transitions. [2025-03-08 13:58:08,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 13:58:08,039 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:58:08,040 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:58:08,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 13:58:08,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:58:08,241 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:58:08,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:58:08,242 INFO L85 PathProgramCache]: Analyzing trace with hash 795325113, now seen corresponding path program 1 times [2025-03-08 13:58:08,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:58:08,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1601070780] [2025-03-08 13:58:08,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:58:08,242 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:58:08,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:58:08,244 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 13:58:08,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 13:58:08,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 13:58:09,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 13:58:09,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:58:09,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:58:09,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 13:58:09,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:58:11,283 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 243 proven. 27 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-08 13:58:11,283 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 13:58:13,907 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 18 proven. 27 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-08 13:58:13,907 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:58:13,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1601070780] [2025-03-08 13:58:13,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1601070780] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 13:58:13,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 13:58:13,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-08 13:58:13,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362081798] [2025-03-08 13:58:13,907 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 13:58:13,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 13:58:13,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:58:13,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 13:58:13,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 13:58:13,908 INFO L87 Difference]: Start difference. First operand 68 states and 102 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-08 13:58:20,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.39s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:58:24,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:58:28,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:58:29,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:58:29,391 INFO L93 Difference]: Finished difference Result 153 states and 226 transitions. [2025-03-08 13:58:29,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 13:58:29,392 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 113 [2025-03-08 13:58:29,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:58:29,393 INFO L225 Difference]: With dead ends: 153 [2025-03-08 13:58:29,393 INFO L226 Difference]: Without dead ends: 88 [2025-03-08 13:58:29,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 218 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-08 13:58:29,394 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 160 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 27 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.1s IncrementalHoareTripleChecker+Time [2025-03-08 13:58:29,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 212 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 136 Invalid, 3 Unknown, 0 Unchecked, 15.1s Time] [2025-03-08 13:58:29,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-08 13:58:29,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 83. [2025-03-08 13:58:29,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 58 states have internal predecessors, (76), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 13:58:29,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 120 transitions. [2025-03-08 13:58:29,401 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 120 transitions. Word has length 113 [2025-03-08 13:58:29,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:58:29,401 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 120 transitions. [2025-03-08 13:58:29,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-08 13:58:29,401 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 120 transitions. [2025-03-08 13:58:29,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 13:58:29,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:58:29,402 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:58:29,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-08 13:58:29,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:58:29,603 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:58:29,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:58:29,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1749023095, now seen corresponding path program 1 times [2025-03-08 13:58:29,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:58:29,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [943557228] [2025-03-08 13:58:29,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:58:29,606 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:58:29,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:58:29,608 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 13:58:29,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-08 13:58:29,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 13:58:30,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 13:58:30,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:58:30,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:58:30,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 13:58:30,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:58:37,886 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 45 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 13:58:37,886 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 13:58:44,877 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-08 13:58:44,877 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:58:44,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [943557228] [2025-03-08 13:58:44,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [943557228] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 13:58:44,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 13:58:44,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-03-08 13:58:44,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080747844] [2025-03-08 13:58:44,877 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 13:58:44,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 13:58:44,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:58:44,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 13:58:44,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2025-03-08 13:58:44,878 INFO L87 Difference]: Start difference. First operand 83 states and 120 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 4 states have call successors, (32), 3 states have call predecessors, (32), 4 states have return successors, (32), 2 states have call predecessors, (32), 4 states have call successors, (32) [2025-03-08 13:58:51,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []