./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-80.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-80.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 8f27fb34f402b9a11855b517957953eefe825c2ac20a4109c7810b48044f1231 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:08:34,669 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:08:34,725 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 21:08:34,730 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:08:34,732 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:08:34,752 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:08:34,753 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:08:34,753 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:08:34,753 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:08:34,753 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:08:34,754 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:08:34,754 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:08:34,755 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:08:34,755 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:08:34,755 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:08:34,755 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:08:34,755 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:08:34,755 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:08:34,755 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 21:08:34,756 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:08:34,756 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:08:34,756 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:08:34,756 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:08:34,756 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:08:34,756 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:08:34,756 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:08:34,756 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:08:34,756 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:08:34,756 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:08:34,756 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:08:34,757 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:08:34,757 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:08:34,757 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:08:34,757 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:08:34,757 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:08:34,757 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:08:34,757 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:08:34,757 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 21:08:34,757 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 21:08:34,757 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:08:34,757 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:08:34,757 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:08:34,757 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:08:34,758 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 -> 8f27fb34f402b9a11855b517957953eefe825c2ac20a4109c7810b48044f1231 [2025-03-03 21:08:34,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:08:34,987 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:08:34,988 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:08:34,989 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:08:34,989 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:08:34,991 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-80.i [2025-03-03 21:08:36,129 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6129d70a0/3697a91bfe5c461a84d399de96d86d78/FLAGcddc5c83b [2025-03-03 21:08:36,332 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:08:36,333 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-80.i [2025-03-03 21:08:36,339 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6129d70a0/3697a91bfe5c461a84d399de96d86d78/FLAGcddc5c83b [2025-03-03 21:08:36,349 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6129d70a0/3697a91bfe5c461a84d399de96d86d78 [2025-03-03 21:08:36,350 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:08:36,351 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:08:36,352 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:08:36,352 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:08:36,355 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:08:36,355 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:08:36" (1/1) ... [2025-03-03 21:08:36,356 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2de866dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:36, skipping insertion in model container [2025-03-03 21:08:36,356 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:08:36" (1/1) ... [2025-03-03 21:08:36,368 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:08:36,462 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-80.i[919,932] [2025-03-03 21:08:36,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:08:36,556 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:08:36,563 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-80.i[919,932] [2025-03-03 21:08:36,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:08:36,610 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:08:36,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:36 WrapperNode [2025-03-03 21:08:36,611 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:08:36,611 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:08:36,612 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:08:36,612 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:08:36,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:36" (1/1) ... [2025-03-03 21:08:36,623 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:36" (1/1) ... [2025-03-03 21:08:36,665 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 219 [2025-03-03 21:08:36,665 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:08:36,667 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:08:36,667 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:08:36,667 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:08:36,673 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:36" (1/1) ... [2025-03-03 21:08:36,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:36" (1/1) ... [2025-03-03 21:08:36,677 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:36" (1/1) ... [2025-03-03 21:08:36,696 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 21:08:36,701 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:36" (1/1) ... [2025-03-03 21:08:36,702 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:36" (1/1) ... [2025-03-03 21:08:36,710 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:36" (1/1) ... [2025-03-03 21:08:36,711 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:36" (1/1) ... [2025-03-03 21:08:36,717 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:36" (1/1) ... [2025-03-03 21:08:36,721 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:36" (1/1) ... [2025-03-03 21:08:36,725 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:08:36,725 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:08:36,726 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:08:36,726 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:08:36,727 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:36" (1/1) ... [2025-03-03 21:08:36,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:08:36,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:08:36,752 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 21:08:36,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 21:08:36,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:08:36,773 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:08:36,773 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:08:36,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 21:08:36,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:08:36,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:08:36,834 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:08:36,836 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:08:37,225 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-03 21:08:37,226 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:08:37,245 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:08:37,246 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:08:37,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:08:37 BoogieIcfgContainer [2025-03-03 21:08:37,246 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:08:37,248 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:08:37,248 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:08:37,251 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:08:37,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:08:36" (1/3) ... [2025-03-03 21:08:37,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f03736b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:08:37, skipping insertion in model container [2025-03-03 21:08:37,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:36" (2/3) ... [2025-03-03 21:08:37,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f03736b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:08:37, skipping insertion in model container [2025-03-03 21:08:37,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:08:37" (3/3) ... [2025-03-03 21:08:37,252 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-80.i [2025-03-03 21:08:37,262 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:08:37,265 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-80.i that has 2 procedures, 94 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:08:37,315 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:08:37,324 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;@4e9a7dad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:08:37,325 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:08:37,329 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 62 states have (on average 1.435483870967742) internal successors, (89), 63 states have internal predecessors, (89), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-03 21:08:37,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-03 21:08:37,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:08:37,344 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:08:37,344 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:08:37,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:08:37,350 INFO L85 PathProgramCache]: Analyzing trace with hash 258746012, now seen corresponding path program 1 times [2025-03-03 21:08:37,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:08:37,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84753206] [2025-03-03 21:08:37,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:08:37,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:08:37,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-03 21:08:37,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-03 21:08:37,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:08:37,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:08:37,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2025-03-03 21:08:37,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:08:37,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84753206] [2025-03-03 21:08:37,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84753206] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:08:37,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945940312] [2025-03-03 21:08:37,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:08:37,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:08:37,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:08:37,617 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:08:37,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 21:08:37,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-03 21:08:37,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-03 21:08:37,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:08:37,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:08:37,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:08:37,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:08:37,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2025-03-03 21:08:37,858 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:08:37,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945940312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:08:37,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:08:37,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 21:08:37,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174503249] [2025-03-03 21:08:37,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:08:37,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:08:37,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:08:37,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:08:37,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:08:37,884 INFO L87 Difference]: Start difference. First operand has 94 states, 62 states have (on average 1.435483870967742) internal successors, (89), 63 states have internal predecessors, (89), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-03 21:08:37,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:08:37,914 INFO L93 Difference]: Finished difference Result 182 states and 318 transitions. [2025-03-03 21:08:37,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:08:37,917 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 190 [2025-03-03 21:08:37,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:08:37,923 INFO L225 Difference]: With dead ends: 182 [2025-03-03 21:08:37,924 INFO L226 Difference]: Without dead ends: 91 [2025-03-03 21:08:37,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:08:37,930 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 139 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-03 21:08:37,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:08:37,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-03 21:08:37,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-03-03 21:08:37,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 60 states have (on average 1.4) internal successors, (84), 60 states have internal predecessors, (84), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-03 21:08:37,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 142 transitions. [2025-03-03 21:08:37,972 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 142 transitions. Word has length 190 [2025-03-03 21:08:37,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:08:37,972 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 142 transitions. [2025-03-03 21:08:37,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-03 21:08:37,973 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 142 transitions. [2025-03-03 21:08:37,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-03 21:08:37,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:08:37,977 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:08:37,984 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-03 21:08:38,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 21:08:38,178 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:08:38,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:08:38,178 INFO L85 PathProgramCache]: Analyzing trace with hash 120358655, now seen corresponding path program 1 times [2025-03-03 21:08:38,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:08:38,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724991250] [2025-03-03 21:08:38,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:08:38,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:08:38,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-03 21:08:38,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-03 21:08:38,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:08:38,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:08:38,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-03 21:08:38,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:08:38,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724991250] [2025-03-03 21:08:38,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724991250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:08:38,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:08:38,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:08:38,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460884107] [2025-03-03 21:08:38,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:08:38,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:08:38,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:08:38,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:08:38,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:08:38,549 INFO L87 Difference]: Start difference. First operand 91 states and 142 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 21:08:38,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:08:38,626 INFO L93 Difference]: Finished difference Result 267 states and 420 transitions. [2025-03-03 21:08:38,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:08:38,626 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 190 [2025-03-03 21:08:38,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:08:38,628 INFO L225 Difference]: With dead ends: 267 [2025-03-03 21:08:38,628 INFO L226 Difference]: Without dead ends: 179 [2025-03-03 21:08:38,629 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-03 21:08:38,629 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 137 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:08:38,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 381 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:08:38,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-03-03 21:08:38,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 94. [2025-03-03 21:08:38,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 63 states have internal predecessors, (88), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-03 21:08:38,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 146 transitions. [2025-03-03 21:08:38,648 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 146 transitions. Word has length 190 [2025-03-03 21:08:38,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:08:38,649 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 146 transitions. [2025-03-03 21:08:38,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 21:08:38,650 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 146 transitions. [2025-03-03 21:08:38,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-03 21:08:38,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:08:38,653 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:08:38,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 21:08:38,654 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:08:38,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:08:38,654 INFO L85 PathProgramCache]: Analyzing trace with hash -876713698, now seen corresponding path program 1 times [2025-03-03 21:08:38,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:08:38,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855264874] [2025-03-03 21:08:38,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:08:38,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:08:38,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-03 21:08:38,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-03 21:08:38,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:08:38,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:08:38,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-03 21:08:38,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:08:38,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855264874] [2025-03-03 21:08:38,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855264874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:08:38,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:08:38,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:08:38,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232514062] [2025-03-03 21:08:38,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:08:38,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:08:38,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:08:38,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:08:38,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:08:38,974 INFO L87 Difference]: Start difference. First operand 94 states and 146 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 21:08:39,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:08:39,037 INFO L93 Difference]: Finished difference Result 276 states and 432 transitions. [2025-03-03 21:08:39,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:08:39,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 190 [2025-03-03 21:08:39,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:08:39,040 INFO L225 Difference]: With dead ends: 276 [2025-03-03 21:08:39,041 INFO L226 Difference]: Without dead ends: 185 [2025-03-03 21:08:39,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:08:39,042 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 82 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:08:39,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 291 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:08:39,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-03 21:08:39,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2025-03-03 21:08:39,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 122 states have (on average 1.360655737704918) internal successors, (166), 122 states have internal predecessors, (166), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-03 21:08:39,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 282 transitions. [2025-03-03 21:08:39,076 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 282 transitions. Word has length 190 [2025-03-03 21:08:39,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:08:39,077 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 282 transitions. [2025-03-03 21:08:39,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 21:08:39,078 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 282 transitions. [2025-03-03 21:08:39,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-03 21:08:39,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:08:39,082 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:08:39,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 21:08:39,083 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:08:39,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:08:39,083 INFO L85 PathProgramCache]: Analyzing trace with hash -77114657, now seen corresponding path program 1 times [2025-03-03 21:08:39,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:08:39,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273981326] [2025-03-03 21:08:39,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:08:39,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:08:39,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-03 21:08:39,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-03 21:08:39,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:08:39,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:08:39,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-03 21:08:39,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:08:39,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273981326] [2025-03-03 21:08:39,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273981326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:08:39,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:08:39,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:08:39,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039790569] [2025-03-03 21:08:39,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:08:39,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:08:39,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:08:39,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:08:39,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:08:39,186 INFO L87 Difference]: Start difference. First operand 183 states and 282 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 21:08:39,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:08:39,216 INFO L93 Difference]: Finished difference Result 271 states and 415 transitions. [2025-03-03 21:08:39,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:08:39,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 190 [2025-03-03 21:08:39,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:08:39,220 INFO L225 Difference]: With dead ends: 271 [2025-03-03 21:08:39,220 INFO L226 Difference]: Without dead ends: 91 [2025-03-03 21:08:39,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:08:39,221 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:08:39,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 258 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:08:39,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-03 21:08:39,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-03-03 21:08:39,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 60 states have internal predecessors, (77), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-03 21:08:39,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 135 transitions. [2025-03-03 21:08:39,238 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 135 transitions. Word has length 190 [2025-03-03 21:08:39,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:08:39,239 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 135 transitions. [2025-03-03 21:08:39,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 21:08:39,240 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 135 transitions. [2025-03-03 21:08:39,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-03 21:08:39,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:08:39,241 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:08:39,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 21:08:39,241 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:08:39,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:08:39,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1536462207, now seen corresponding path program 1 times [2025-03-03 21:08:39,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:08:39,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920650209] [2025-03-03 21:08:39,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:08:39,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:08:39,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-03 21:08:39,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-03 21:08:39,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:08:39,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:08:39,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-03 21:08:39,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:08:39,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920650209] [2025-03-03 21:08:39,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920650209] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:08:39,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:08:39,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:08:39,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136776992] [2025-03-03 21:08:39,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:08:39,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:08:39,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:08:39,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:08:39,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:08:39,440 INFO L87 Difference]: Start difference. First operand 91 states and 135 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 21:08:39,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:08:39,519 INFO L93 Difference]: Finished difference Result 179 states and 267 transitions. [2025-03-03 21:08:39,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:08:39,522 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 192 [2025-03-03 21:08:39,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:08:39,523 INFO L225 Difference]: With dead ends: 179 [2025-03-03 21:08:39,525 INFO L226 Difference]: Without dead ends: 91 [2025-03-03 21:08:39,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:08:39,526 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 165 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:08:39,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 120 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:08:39,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-03 21:08:39,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-03-03 21:08:39,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 60 states have internal predecessors, (76), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-03 21:08:39,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 134 transitions. [2025-03-03 21:08:39,542 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 134 transitions. Word has length 192 [2025-03-03 21:08:39,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:08:39,542 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 134 transitions. [2025-03-03 21:08:39,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 21:08:39,542 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 134 transitions. [2025-03-03 21:08:39,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-03 21:08:39,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:08:39,543 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:08:39,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 21:08:39,544 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:08:39,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:08:39,548 INFO L85 PathProgramCache]: Analyzing trace with hash 201735787, now seen corresponding path program 1 times [2025-03-03 21:08:39,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:08:39,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781625323] [2025-03-03 21:08:39,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:08:39,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:08:39,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-03 21:08:39,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-03 21:08:39,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:08:39,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:08:39,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-03 21:08:39,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:08:39,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781625323] [2025-03-03 21:08:39,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781625323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:08:39,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:08:39,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:08:39,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355179413] [2025-03-03 21:08:39,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:08:39,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:08:39,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:08:39,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:08:39,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:08:39,684 INFO L87 Difference]: Start difference. First operand 91 states and 134 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 21:08:39,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:08:39,732 INFO L93 Difference]: Finished difference Result 180 states and 267 transitions. [2025-03-03 21:08:39,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:08:39,733 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 193 [2025-03-03 21:08:39,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:08:39,734 INFO L225 Difference]: With dead ends: 180 [2025-03-03 21:08:39,734 INFO L226 Difference]: Without dead ends: 92 [2025-03-03 21:08:39,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:08:39,735 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 71 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:08:39,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 242 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:08:39,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-03 21:08:39,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-03 21:08:39,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 61 states have (on average 1.2622950819672132) internal successors, (77), 61 states have internal predecessors, (77), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-03 21:08:39,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 135 transitions. [2025-03-03 21:08:39,753 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 135 transitions. Word has length 193 [2025-03-03 21:08:39,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:08:39,753 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 135 transitions. [2025-03-03 21:08:39,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 21:08:39,754 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 135 transitions. [2025-03-03 21:08:39,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-03 21:08:39,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:08:39,756 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:08:39,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 21:08:39,756 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:08:39,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:08:39,757 INFO L85 PathProgramCache]: Analyzing trace with hash 330818506, now seen corresponding path program 1 times [2025-03-03 21:08:39,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:08:39,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760423302] [2025-03-03 21:08:39,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:08:39,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:08:39,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-03 21:08:39,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-03 21:08:39,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:08:39,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:08:39,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-03 21:08:39,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:08:39,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760423302] [2025-03-03 21:08:39,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760423302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:08:39,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:08:39,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 21:08:39,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482630797] [2025-03-03 21:08:39,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:08:39,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:08:39,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:08:39,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:08:39,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:08:39,998 INFO L87 Difference]: Start difference. First operand 92 states and 135 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 21:08:40,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:08:40,359 INFO L93 Difference]: Finished difference Result 294 states and 434 transitions. [2025-03-03 21:08:40,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 21:08:40,360 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 193 [2025-03-03 21:08:40,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:08:40,364 INFO L225 Difference]: With dead ends: 294 [2025-03-03 21:08:40,364 INFO L226 Difference]: Without dead ends: 205 [2025-03-03 21:08:40,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 21:08:40,365 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 163 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 21:08:40,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 404 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 21:08:40,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-03 21:08:40,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 182. [2025-03-03 21:08:40,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 121 states have (on average 1.2644628099173554) internal successors, (153), 121 states have internal predecessors, (153), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-03 21:08:40,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 269 transitions. [2025-03-03 21:08:40,409 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 269 transitions. Word has length 193 [2025-03-03 21:08:40,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:08:40,409 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 269 transitions. [2025-03-03 21:08:40,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 21:08:40,410 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 269 transitions. [2025-03-03 21:08:40,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-03 21:08:40,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:08:40,411 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:08:40,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 21:08:40,412 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:08:40,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:08:40,413 INFO L85 PathProgramCache]: Analyzing trace with hash 255458962, now seen corresponding path program 1 times [2025-03-03 21:08:40,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:08:40,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734960502] [2025-03-03 21:08:40,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:08:40,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:08:40,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-03 21:08:40,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-03 21:08:40,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:08:40,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:08:40,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-03 21:08:40,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:08:40,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734960502] [2025-03-03 21:08:40,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734960502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:08:40,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:08:40,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 21:08:40,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269982906] [2025-03-03 21:08:40,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:08:40,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 21:08:40,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:08:40,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 21:08:40,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:08:40,658 INFO L87 Difference]: Start difference. First operand 182 states and 269 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 21:08:40,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:08:40,807 INFO L93 Difference]: Finished difference Result 361 states and 535 transitions. [2025-03-03 21:08:40,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:08:40,809 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 194 [2025-03-03 21:08:40,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:08:40,811 INFO L225 Difference]: With dead ends: 361 [2025-03-03 21:08:40,811 INFO L226 Difference]: Without dead ends: 182 [2025-03-03 21:08:40,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-03 21:08:40,812 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 193 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:08:40,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 235 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:08:40,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-03 21:08:40,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2025-03-03 21:08:40,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 120 states have (on average 1.25) internal successors, (150), 120 states have internal predecessors, (150), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-03 21:08:40,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 266 transitions. [2025-03-03 21:08:40,850 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 266 transitions. Word has length 194 [2025-03-03 21:08:40,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:08:40,851 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 266 transitions. [2025-03-03 21:08:40,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 21:08:40,851 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 266 transitions. [2025-03-03 21:08:40,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-03 21:08:40,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:08:40,854 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:08:40,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 21:08:40,854 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:08:40,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:08:40,854 INFO L85 PathProgramCache]: Analyzing trace with hash 384541681, now seen corresponding path program 1 times [2025-03-03 21:08:40,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:08:40,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232906363] [2025-03-03 21:08:40,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:08:40,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:08:40,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-03 21:08:40,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-03 21:08:40,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:08:40,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:08:41,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 69 proven. 15 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2025-03-03 21:08:41,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:08:41,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232906363] [2025-03-03 21:08:41,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232906363] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:08:41,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309704898] [2025-03-03 21:08:41,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:08:41,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:08:41,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:08:41,376 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:08:41,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 21:08:41,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-03 21:08:41,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-03 21:08:41,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:08:41,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:08:41,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 21:08:41,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:08:41,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 534 proven. 15 refuted. 0 times theorem prover too weak. 1075 trivial. 0 not checked. [2025-03-03 21:08:41,639 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:08:41,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 69 proven. 15 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2025-03-03 21:08:41,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309704898] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:08:41,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 21:08:41,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 6] total 13 [2025-03-03 21:08:41,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968642662] [2025-03-03 21:08:41,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 21:08:41,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 21:08:41,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:08:41,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 21:08:41,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-03-03 21:08:41,919 INFO L87 Difference]: Start difference. First operand 181 states and 266 transitions. Second operand has 13 states, 13 states have (on average 9.538461538461538) internal successors, (124), 13 states have internal predecessors, (124), 5 states have call successors, (63), 2 states have call predecessors, (63), 4 states have return successors, (64), 5 states have call predecessors, (64), 5 states have call successors, (64) [2025-03-03 21:08:42,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:08:42,745 INFO L93 Difference]: Finished difference Result 461 states and 658 transitions. [2025-03-03 21:08:42,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 21:08:42,746 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.538461538461538) internal successors, (124), 13 states have internal predecessors, (124), 5 states have call successors, (63), 2 states have call predecessors, (63), 4 states have return successors, (64), 5 states have call predecessors, (64), 5 states have call successors, (64) Word has length 194 [2025-03-03 21:08:42,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:08:42,748 INFO L225 Difference]: With dead ends: 461 [2025-03-03 21:08:42,748 INFO L226 Difference]: Without dead ends: 283 [2025-03-03 21:08:42,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2025-03-03 21:08:42,749 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 589 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 21:08:42,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 557 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 21:08:42,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-03-03 21:08:42,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 267. [2025-03-03 21:08:42,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 190 states have (on average 1.236842105263158) internal successors, (235), 192 states have internal predecessors, (235), 70 states have call successors, (70), 6 states have call predecessors, (70), 6 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-03 21:08:42,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 375 transitions. [2025-03-03 21:08:42,783 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 375 transitions. Word has length 194 [2025-03-03 21:08:42,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:08:42,784 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 375 transitions. [2025-03-03 21:08:42,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.538461538461538) internal successors, (124), 13 states have internal predecessors, (124), 5 states have call successors, (63), 2 states have call predecessors, (63), 4 states have return successors, (64), 5 states have call predecessors, (64), 5 states have call successors, (64) [2025-03-03 21:08:42,784 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 375 transitions. [2025-03-03 21:08:42,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-03 21:08:42,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:08:42,785 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:08:42,792 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-03 21:08:42,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-03 21:08:42,986 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:08:42,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:08:42,987 INFO L85 PathProgramCache]: Analyzing trace with hash -244992291, now seen corresponding path program 1 times [2025-03-03 21:08:42,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:08:42,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406321708] [2025-03-03 21:08:42,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:08:42,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:08:43,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-03 21:08:43,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-03 21:08:43,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:08:43,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 21:08:43,072 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 21:08:43,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-03 21:08:43,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-03 21:08:43,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:08:43,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 21:08:43,205 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 21:08:43,205 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 21:08:43,206 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 21:08:43,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 21:08:43,210 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:08:43,335 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 21:08:43,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 09:08:43 BoogieIcfgContainer [2025-03-03 21:08:43,341 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 21:08:43,342 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 21:08:43,342 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 21:08:43,342 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 21:08:43,342 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:08:37" (3/4) ... [2025-03-03 21:08:43,344 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 21:08:43,344 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 21:08:43,345 INFO L158 Benchmark]: Toolchain (without parser) took 6993.42ms. Allocated memory was 167.8MB in the beginning and 209.7MB in the end (delta: 41.9MB). Free memory was 128.5MB in the beginning and 156.6MB in the end (delta: -28.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2025-03-03 21:08:43,345 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:08:43,345 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.96ms. Allocated memory is still 167.8MB. Free memory was 128.5MB in the beginning and 113.0MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 21:08:43,345 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.74ms. Allocated memory is still 167.8MB. Free memory was 113.0MB in the beginning and 108.5MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:08:43,345 INFO L158 Benchmark]: Boogie Preprocessor took 58.33ms. Allocated memory is still 167.8MB. Free memory was 108.5MB in the beginning and 101.6MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 21:08:43,345 INFO L158 Benchmark]: IcfgBuilder took 520.92ms. Allocated memory is still 167.8MB. Free memory was 101.6MB in the beginning and 73.5MB in the end (delta: 28.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 21:08:43,346 INFO L158 Benchmark]: TraceAbstraction took 6093.37ms. Allocated memory was 167.8MB in the beginning and 209.7MB in the end (delta: 41.9MB). Free memory was 72.9MB in the beginning and 156.7MB in the end (delta: -83.8MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. [2025-03-03 21:08:43,346 INFO L158 Benchmark]: Witness Printer took 2.65ms. Allocated memory is still 209.7MB. Free memory was 156.7MB in the beginning and 156.6MB in the end (delta: 64.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:08:43,347 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.22ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 258.96ms. Allocated memory is still 167.8MB. Free memory was 128.5MB in the beginning and 113.0MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.74ms. Allocated memory is still 167.8MB. Free memory was 113.0MB in the beginning and 108.5MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 58.33ms. Allocated memory is still 167.8MB. Free memory was 108.5MB in the beginning and 101.6MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 520.92ms. Allocated memory is still 167.8MB. Free memory was 101.6MB in the beginning and 73.5MB in the end (delta: 28.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6093.37ms. Allocated memory was 167.8MB in the beginning and 209.7MB in the end (delta: 41.9MB). Free memory was 72.9MB in the beginning and 156.7MB in the end (delta: -83.8MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. * Witness Printer took 2.65ms. Allocated memory is still 209.7MB. Free memory was 156.7MB in the beginning and 156.6MB in the end (delta: 64.6kB). 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 someBinaryArithmeticDOUBLEoperation at line 83, overapproximation of someBinaryFLOATComparisonOperation at line 147, overapproximation of someBinaryFLOATComparisonOperation at line 149, overapproximation of someBinaryFLOATComparisonOperation at line 92, overapproximation of someBinaryFLOATComparisonOperation at line 145, overapproximation of someBinaryFLOATComparisonOperation at line 180, overapproximation of bitwiseAnd at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 132, overapproximation of someBinaryDOUBLEComparisonOperation at line 160, overapproximation of someBinaryDOUBLEComparisonOperation at line 134, overapproximation of someBinaryDOUBLEComparisonOperation at line 142, overapproximation of someBinaryDOUBLEComparisonOperation at line 143, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 162, overapproximation of someBinaryDOUBLEComparisonOperation at line 180, overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someBinaryDOUBLEComparisonOperation at line 84, overapproximation of someBinaryDOUBLEComparisonOperation at line 128, overapproximation of someBinaryDOUBLEComparisonOperation at line 119, overapproximation of someBinaryDOUBLEComparisonOperation at line 130. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 128; [L23] double var_1_2 = 24.25; [L24] double var_1_3 = 128.5; [L25] double var_1_4 = 4.5; [L26] double var_1_5 = 49.5; [L27] signed short int var_1_9 = -25; [L28] unsigned char var_1_10 = 200; [L29] unsigned char var_1_11 = 1; [L30] unsigned char var_1_12 = 1; [L31] double var_1_13 = 128.375; [L32] unsigned short int var_1_14 = 0; [L33] float var_1_15 = 0.0; [L34] float var_1_16 = 4.87; [L35] float var_1_17 = 8.875; [L36] signed short int var_1_18 = -128; [L37] unsigned char var_1_19 = 0; [L38] unsigned char var_1_20 = 1; [L39] unsigned char var_1_21 = 0; [L40] unsigned long int var_1_22 = 16; [L41] unsigned long int var_1_23 = 4200661734; [L42] float var_1_24 = 9999999999.375; [L43] double var_1_28 = 9.25; [L44] double var_1_29 = 0.0; [L45] double var_1_30 = 127.6; [L46] unsigned long int var_1_32 = 128; [L47] unsigned long int var_1_34 = 1089279310; [L48] unsigned long int var_1_35 = 1307137784; [L49] unsigned long int var_1_36 = 1417807175; [L50] unsigned long int var_1_38 = 2; [L51] unsigned short int var_1_40 = 5; [L52] unsigned char var_1_44 = 5; [L53] unsigned char var_1_46 = 16; [L54] unsigned char last_1_var_1_10 = 200; VAL [isInitial=0, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_2=97/4, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_3=257/2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L184] isInitial = 1 [L185] FCALL initially() [L186] COND TRUE 1 [L187] CALL updateLastVariables() [L177] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_2=97/4, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_3=257/2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L187] RET updateLastVariables() [L188] CALL updateVariables() [L127] var_1_2 = __VERIFIER_nondet_double() [L128] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_3=257/2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_3=257/2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L128] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_3=257/2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L129] var_1_3 = __VERIFIER_nondet_double() [L130] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L130] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L131] var_1_4 = __VERIFIER_nondet_double() [L132] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_5=99/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_5=99/2, var_1_9=-25] [L132] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_5=99/2, var_1_9=-25] [L133] var_1_5 = __VERIFIER_nondet_double() [L134] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L134] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L135] var_1_11 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L136] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L137] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L137] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L138] var_1_12 = __VERIFIER_nondet_uchar() [L139] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L139] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L140] CALL assume_abort_if_not(var_1_12 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L140] RET assume_abort_if_not(var_1_12 <= 254) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L141] var_1_13 = __VERIFIER_nondet_double() [L142] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L142] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L143] CALL assume_abort_if_not(var_1_13 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L143] RET assume_abort_if_not(var_1_13 != 0.0F) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L144] var_1_15 = __VERIFIER_nondet_float() [L145] CALL assume_abort_if_not((var_1_15 >= 4611686.018427387900e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L145] RET assume_abort_if_not((var_1_15 >= 4611686.018427387900e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L146] var_1_16 = __VERIFIER_nondet_float() [L147] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427387900e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L147] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427387900e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L148] var_1_17 = __VERIFIER_nondet_float() [L149] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L149] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L150] var_1_20 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L151] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L152] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L152] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L153] var_1_21 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L154] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L155] CALL assume_abort_if_not(var_1_21 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L155] RET assume_abort_if_not(var_1_21 <= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L156] var_1_23 = __VERIFIER_nondet_ulong() [L157] CALL assume_abort_if_not(var_1_23 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L157] RET assume_abort_if_not(var_1_23 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L158] CALL assume_abort_if_not(var_1_23 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L158] RET assume_abort_if_not(var_1_23 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L159] var_1_29 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_29 >= 2305843.009213691390e+12F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 4611686.018427382800e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L160] RET assume_abort_if_not((var_1_29 >= 2305843.009213691390e+12F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 4611686.018427382800e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L161] var_1_30 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_30 >= 0.0F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 2305843.009213691390e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L162] RET assume_abort_if_not((var_1_30 >= 0.0F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 2305843.009213691390e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L163] var_1_34 = __VERIFIER_nondet_ulong() [L164] CALL assume_abort_if_not(var_1_34 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L164] RET assume_abort_if_not(var_1_34 >= 1073741823) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L165] CALL assume_abort_if_not(var_1_34 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L165] RET assume_abort_if_not(var_1_34 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L166] var_1_35 = __VERIFIER_nondet_ulong() [L167] CALL assume_abort_if_not(var_1_35 >= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L167] RET assume_abort_if_not(var_1_35 >= 1073741824) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L168] CALL assume_abort_if_not(var_1_35 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L168] RET assume_abort_if_not(var_1_35 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L169] var_1_36 = __VERIFIER_nondet_ulong() [L170] CALL assume_abort_if_not(var_1_36 >= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L170] RET assume_abort_if_not(var_1_36 >= 1073741824) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L171] CALL assume_abort_if_not(var_1_36 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L171] RET assume_abort_if_not(var_1_36 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L172] var_1_46 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_46 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_9=-25] [L173] RET assume_abort_if_not(var_1_46 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_9=-25] [L174] CALL assume_abort_if_not(var_1_46 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-25] [L174] RET assume_abort_if_not(var_1_46 <= 127) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-25] [L188] RET updateVariables() [L189] CALL step() [L58] signed long int stepLocal_0 = last_1_var_1_10; VAL [isInitial=1, last_1_var_1_10=200, stepLocal_0=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-25] [L59] COND TRUE stepLocal_0 >= last_1_var_1_10 [L60] var_1_9 = (-256 + last_1_var_1_10) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-56] [L64] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-56] [L67] signed short int stepLocal_1 = var_1_9; VAL [isInitial=1, last_1_var_1_10=200, stepLocal_1=-56, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-56] [L68] COND FALSE !(stepLocal_1 > 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-56] [L71] EXPR var_1_10 & var_1_12 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-56] [L71] COND TRUE -32 < (var_1_10 & var_1_12) [L72] var_1_44 = ((((var_1_12) < ((var_1_46 + 10))) ? (var_1_12) : ((var_1_46 + 10)))) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L76] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L79] COND TRUE ! (var_1_5 > (255.9 / var_1_13)) [L80] var_1_10 = var_1_12 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L83] var_1_28 = ((8.18603254193775E18 - (var_1_29 - var_1_30)) - var_1_16) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L84] COND TRUE ((var_1_2 - var_1_3) * var_1_4) < var_1_5 [L85] var_1_1 = ((((-8) < ((var_1_10 + ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10)))))) ? (-8) : ((var_1_10 + ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10))))))) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L89] EXPR var_1_9 & var_1_18 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L89] COND FALSE !((var_1_9 & var_1_18) >= -2) [L92] COND FALSE !((var_1_17 <= (- var_1_16)) && var_1_19) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L95] COND FALSE !((((((var_1_30 * var_1_17)) < (var_1_29)) ? ((var_1_30 * var_1_17)) : (var_1_29))) >= (- var_1_16)) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_24=79999999995/8, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L102] COND FALSE !(\read(var_1_19)) [L105] var_1_22 = (((((var_1_23 - var_1_9)) < (var_1_10)) ? ((var_1_23 - var_1_9)) : (var_1_10))) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=-2, var_1_24=79999999995/8, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L107] EXPR var_1_35 | var_1_10 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=-2, var_1_24=79999999995/8, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L107] COND FALSE !((var_1_35 | var_1_10) > var_1_18) [L118] COND TRUE ! var_1_19 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=-2, var_1_24=79999999995/8, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L119] COND TRUE ((var_1_15 - var_1_16) - var_1_17) <= var_1_13 [L120] var_1_14 = var_1_18 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=-2, var_1_24=79999999995/8, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L189] RET step() [L190] CALL, EXPR property() [L180-L181] return (((((((((var_1_2 - var_1_3) * var_1_4) < var_1_5) ? (var_1_1 == ((signed short int) ((((-8) < ((var_1_10 + ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10)))))) ? (-8) : ((var_1_10 + ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10))))))))) : (var_1_1 == ((signed short int) var_1_10))) && ((last_1_var_1_10 >= last_1_var_1_10) ? (var_1_9 == ((signed short int) (-256 + last_1_var_1_10))) : (var_1_9 == ((signed short int) (last_1_var_1_10 + last_1_var_1_10))))) && (var_1_19 ? (var_1_10 == ((unsigned char) ((((0) < (var_1_12)) ? (0) : (var_1_12))))) : ((! (var_1_5 > (255.9 / var_1_13))) ? (var_1_10 == ((unsigned char) var_1_12)) : 1))) && ((! var_1_19) ? ((((var_1_15 - var_1_16) - var_1_17) <= var_1_13) ? (var_1_14 == ((unsigned short int) var_1_18)) : (var_1_14 == ((unsigned short int) var_1_18))) : 1)) && (((var_1_17 <= (- var_1_16)) && var_1_19) ? (var_1_18 == ((signed short int) var_1_10)) : 1)) && ((var_1_9 > 0) ? (var_1_19 == ((unsigned char) ((var_1_5 >= (- var_1_15)) && (var_1_11 && (var_1_20 && var_1_21))))) : 1)) && (var_1_19 ? (var_1_22 == ((unsigned long int) (var_1_9 + var_1_10))) : (var_1_22 == ((unsigned long int) (((((var_1_23 - var_1_9)) < (var_1_10)) ? ((var_1_23 - var_1_9)) : (var_1_10)))))) ; VAL [\result=0, isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=-2, var_1_24=79999999995/8, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L190] RET, EXPR property() [L190] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=-2, var_1_24=79999999995/8, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=-2, var_1_24=79999999995/8, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 10, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1446 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1400 mSDsluCounter, 2627 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1443 mSDsCounter, 445 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 948 IncrementalHoareTripleChecker+Invalid, 1393 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 445 mSolverCounterUnsat, 1184 mSDtfsCounter, 948 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 648 GetRequests, 599 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=267occurred in iteration=9, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 127 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 2305 NumberOfCodeBlocks, 2305 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2292 ConstructedInterpolants, 0 QuantifiedInterpolants, 6377 SizeOfPredicates, 4 NumberOfNonLiveVariables, 868 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 19387/19488 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 21:08:43,362 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_fillercode_fillercodestructure_filler-pr-ci_file-80.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 8f27fb34f402b9a11855b517957953eefe825c2ac20a4109c7810b48044f1231 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:08:45,221 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:08:45,293 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 21:08:45,298 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:08:45,298 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:08:45,313 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:08:45,314 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:08:45,314 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:08:45,314 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:08:45,314 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:08:45,314 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:08:45,314 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:08:45,315 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:08:45,315 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:08:45,315 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:08:45,315 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:08:45,315 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:08:45,315 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:08:45,315 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:08:45,315 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:08:45,315 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:08:45,315 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:08:45,315 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:08:45,315 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 21:08:45,315 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 21:08:45,315 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 21:08:45,315 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:08:45,315 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:08:45,315 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:08:45,316 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:08:45,316 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:08:45,316 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:08:45,316 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:08:45,316 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:08:45,316 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:08:45,316 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:08:45,316 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:08:45,316 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:08:45,316 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:08:45,316 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 21:08:45,316 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 21:08:45,316 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:08:45,316 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:08:45,316 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:08:45,316 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:08:45,317 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 -> 8f27fb34f402b9a11855b517957953eefe825c2ac20a4109c7810b48044f1231 [2025-03-03 21:08:45,567 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:08:45,575 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:08:45,577 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:08:45,579 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:08:45,579 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:08:45,581 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-80.i [2025-03-03 21:08:46,779 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/974ae7482/72564a17878b44cba64bc54bb097f087/FLAG19827ead9 [2025-03-03 21:08:46,981 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:08:46,983 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-80.i [2025-03-03 21:08:46,989 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/974ae7482/72564a17878b44cba64bc54bb097f087/FLAG19827ead9 [2025-03-03 21:08:47,001 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/974ae7482/72564a17878b44cba64bc54bb097f087 [2025-03-03 21:08:47,003 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:08:47,004 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:08:47,005 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:08:47,005 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:08:47,008 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:08:47,009 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:08:47" (1/1) ... [2025-03-03 21:08:47,009 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7640dea5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:47, skipping insertion in model container [2025-03-03 21:08:47,009 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:08:47" (1/1) ... [2025-03-03 21:08:47,028 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:08:47,129 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-80.i[919,932] [2025-03-03 21:08:47,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:08:47,186 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:08:47,194 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-80.i[919,932] [2025-03-03 21:08:47,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:08:47,232 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:08:47,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:47 WrapperNode [2025-03-03 21:08:47,233 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:08:47,234 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:08:47,234 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:08:47,234 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:08:47,239 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:47" (1/1) ... [2025-03-03 21:08:47,247 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:47" (1/1) ... [2025-03-03 21:08:47,266 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 192 [2025-03-03 21:08:47,266 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:08:47,267 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:08:47,267 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:08:47,267 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:08:47,275 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:47" (1/1) ... [2025-03-03 21:08:47,275 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:47" (1/1) ... [2025-03-03 21:08:47,278 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:47" (1/1) ... [2025-03-03 21:08:47,287 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 21:08:47,287 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:47" (1/1) ... [2025-03-03 21:08:47,287 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:47" (1/1) ... [2025-03-03 21:08:47,294 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:47" (1/1) ... [2025-03-03 21:08:47,295 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:47" (1/1) ... [2025-03-03 21:08:47,296 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:47" (1/1) ... [2025-03-03 21:08:47,297 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:47" (1/1) ... [2025-03-03 21:08:47,300 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:08:47,300 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:08:47,300 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:08:47,300 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:08:47,301 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:47" (1/1) ... [2025-03-03 21:08:47,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:08:47,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:08:47,326 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 21:08:47,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 21:08:47,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:08:47,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 21:08:47,348 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:08:47,348 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:08:47,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:08:47,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:08:47,409 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:08:47,411 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:09:22,731 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-03 21:09:22,731 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:09:22,737 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:09:22,738 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:09:22,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:09:22 BoogieIcfgContainer [2025-03-03 21:09:22,738 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:09:22,740 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:09:22,740 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:09:22,742 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:09:22,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:08:47" (1/3) ... [2025-03-03 21:09:22,743 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ed9816d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:09:22, skipping insertion in model container [2025-03-03 21:09:22,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:08:47" (2/3) ... [2025-03-03 21:09:22,743 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ed9816d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:09:22, skipping insertion in model container [2025-03-03 21:09:22,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:09:22" (3/3) ... [2025-03-03 21:09:22,749 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-80.i [2025-03-03 21:09:22,758 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:09:22,759 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-80.i that has 2 procedures, 85 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:09:22,796 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:09:22,804 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;@4b44f8d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:09:22,805 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:09:22,809 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 54 states have internal predecessors, (74), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-03 21:09:22,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-03 21:09:22,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:09:22,821 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:09:22,822 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:09:22,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:09:22,826 INFO L85 PathProgramCache]: Analyzing trace with hash -803068263, now seen corresponding path program 1 times [2025-03-03 21:09:22,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:09:22,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [152189385] [2025-03-03 21:09:22,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:09:22,838 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:09:22,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:09:22,840 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 21:09:22,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 21:09:22,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-03 21:09:24,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-03 21:09:24,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:09:24,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:09:24,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:09:24,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:09:24,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 804 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2025-03-03 21:09:24,164 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:09:24,169 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:09:24,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [152189385] [2025-03-03 21:09:24,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [152189385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:09:24,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:09:24,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 21:09:24,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817383901] [2025-03-03 21:09:24,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:09:24,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:09:24,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:09:24,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:09:24,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:09:24,193 INFO L87 Difference]: Start difference. First operand has 85 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 54 states have internal predecessors, (74), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-03 21:09:24,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:09:24,218 INFO L93 Difference]: Finished difference Result 164 states and 288 transitions. [2025-03-03 21:09:24,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:09:24,222 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 187 [2025-03-03 21:09:24,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:09:24,227 INFO L225 Difference]: With dead ends: 164 [2025-03-03 21:09:24,228 INFO L226 Difference]: Without dead ends: 82 [2025-03-03 21:09:24,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:09:24,231 INFO L435 NwaCegarLoop]: 126 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, 126 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:09:24,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:09:24,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-03 21:09:24,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-03 21:09:24,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 51 states have internal predecessors, (68), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-03 21:09:24,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 126 transitions. [2025-03-03 21:09:24,261 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 126 transitions. Word has length 187 [2025-03-03 21:09:24,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:09:24,261 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 126 transitions. [2025-03-03 21:09:24,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-03 21:09:24,261 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 126 transitions. [2025-03-03 21:09:24,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-03 21:09:24,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:09:24,264 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:09:24,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-03 21:09:24,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:09:24,465 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:09:24,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:09:24,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1786075414, now seen corresponding path program 1 times [2025-03-03 21:09:24,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:09:24,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1808720032] [2025-03-03 21:09:24,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:09:24,467 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:09:24,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:09:24,470 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 21:09:24,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 21:09:24,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-03 21:09:25,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-03 21:09:25,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:09:25,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:09:25,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 21:09:25,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:09:29,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-03 21:09:29,699 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:09:29,699 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:09:29,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1808720032] [2025-03-03 21:09:29,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1808720032] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:09:29,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:09:29,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 21:09:29,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472153461] [2025-03-03 21:09:29,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:09:29,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:09:29,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:09:29,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:09:29,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:09:29,704 INFO L87 Difference]: Start difference. First operand 82 states and 126 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 21:09:34,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:09:38,226 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-03 21:09:38,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:09:38,371 INFO L93 Difference]: Finished difference Result 238 states and 368 transitions. [2025-03-03 21:09:38,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:09:38,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 187 [2025-03-03 21:09:38,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:09:38,374 INFO L225 Difference]: With dead ends: 238 [2025-03-03 21:09:38,374 INFO L226 Difference]: Without dead ends: 159 [2025-03-03 21:09:38,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:09:38,375 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 31 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2025-03-03 21:09:38,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 253 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 12 Invalid, 2 Unknown, 0 Unchecked, 8.6s Time] [2025-03-03 21:09:38,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-03 21:09:38,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2025-03-03 21:09:38,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 96 states have (on average 1.28125) internal successors, (123), 96 states have internal predecessors, (123), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-03 21:09:38,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 239 transitions. [2025-03-03 21:09:38,397 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 239 transitions. Word has length 187 [2025-03-03 21:09:38,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:09:38,399 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 239 transitions. [2025-03-03 21:09:38,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 21:09:38,400 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 239 transitions. [2025-03-03 21:09:38,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-03 21:09:38,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:09:38,401 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:09:38,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-03 21:09:38,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:09:38,608 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:09:38,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:09:38,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1155582185, now seen corresponding path program 1 times [2025-03-03 21:09:38,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:09:38,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1389356197] [2025-03-03 21:09:38,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:09:38,609 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:09:38,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:09:38,611 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 21:09:38,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-03 21:09:38,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-03 21:09:39,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-03 21:09:39,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:09:39,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:09:39,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 21:09:39,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:09:40,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-03 21:09:40,106 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:09:40,106 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:09:40,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1389356197] [2025-03-03 21:09:40,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1389356197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:09:40,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:09:40,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:09:40,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612841951] [2025-03-03 21:09:40,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:09:40,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:09:40,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:09:40,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:09:40,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:09:40,108 INFO L87 Difference]: Start difference. First operand 157 states and 239 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 21:09:44,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 21:09:48,907 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 [0] [2025-03-03 21:09:52,913 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 [0] [2025-03-03 21:09:56,919 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 [0] [2025-03-03 21:09:57,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:09:57,061 INFO L93 Difference]: Finished difference Result 465 states and 711 transitions. [2025-03-03 21:09:57,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:09:57,062 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 187 [2025-03-03 21:09:57,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:09:57,065 INFO L225 Difference]: With dead ends: 465 [2025-03-03 21:09:57,065 INFO L226 Difference]: Without dead ends: 311 [2025-03-03 21:09:57,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:09:57,069 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 121 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.8s IncrementalHoareTripleChecker+Time [2025-03-03 21:09:57,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 407 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 4 Unknown, 0 Unchecked, 16.8s Time] [2025-03-03 21:09:57,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-03-03 21:09:57,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 163. [2025-03-03 21:09:57,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 102 states have (on average 1.2745098039215685) internal successors, (130), 102 states have internal predecessors, (130), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-03 21:09:57,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 246 transitions. [2025-03-03 21:09:57,108 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 246 transitions. Word has length 187 [2025-03-03 21:09:57,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:09:57,108 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 246 transitions. [2025-03-03 21:09:57,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 21:09:57,109 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 246 transitions. [2025-03-03 21:09:57,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-03 21:09:57,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:09:57,113 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:09:57,144 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-03 21:09:57,313 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-03 21:09:57,313 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:09:57,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:09:57,314 INFO L85 PathProgramCache]: Analyzing trace with hash 2142312758, now seen corresponding path program 1 times [2025-03-03 21:09:57,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:09:57,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1204776729] [2025-03-03 21:09:57,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:09:57,315 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:09:57,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:09:57,317 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-03 21:09:57,318 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-03 21:09:57,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-03 21:09:58,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-03 21:09:58,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:09:58,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:09:58,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 21:09:58,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:10:03,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-03 21:10:03,060 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:10:03,060 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:10:03,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1204776729] [2025-03-03 21:10:03,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1204776729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:10:03,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:10:03,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:10:03,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976806556] [2025-03-03 21:10:03,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:10:03,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:10:03,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:10:03,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:10:03,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:10:03,063 INFO L87 Difference]: Start difference. First operand 163 states and 246 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 21:10:07,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.04s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:10:11,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:10:13,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []