./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-4.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 fb80e4f0533bc0d87718a3c946d158e7005d734d62d8e11c16c799aba4b0f82b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:54:43,117 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:54:43,163 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 14:54:43,167 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:54:43,167 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:54:43,187 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:54:43,188 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:54:43,188 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:54:43,188 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:54:43,188 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:54:43,189 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:54:43,189 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:54:43,189 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:54:43,189 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:54:43,189 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:54:43,190 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:54:43,190 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:54:43,190 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:54:43,190 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 14:54:43,190 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:54:43,190 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:54:43,190 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:54:43,191 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:54:43,191 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:54:43,191 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:54:43,191 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:54:43,191 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:54:43,191 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:54:43,191 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:54:43,191 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:54:43,191 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:54:43,191 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:54:43,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:54:43,192 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:54:43,192 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:54:43,192 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:54:43,192 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:54:43,192 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 14:54:43,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 14:54:43,192 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:54:43,192 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:54:43,192 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:54:43,192 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:54:43,193 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 -> fb80e4f0533bc0d87718a3c946d158e7005d734d62d8e11c16c799aba4b0f82b [2025-03-08 14:54:43,426 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:54:43,434 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:54:43,436 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:54:43,437 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:54:43,437 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:54:43,438 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-4.i [2025-03-08 14:54:44,593 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73e231bf9/8ce9563949da495e80e79cfd27f4838a/FLAGe1a832dc9 [2025-03-08 14:54:44,815 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:54:44,815 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-4.i [2025-03-08 14:54:44,821 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73e231bf9/8ce9563949da495e80e79cfd27f4838a/FLAGe1a832dc9 [2025-03-08 14:54:45,165 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73e231bf9/8ce9563949da495e80e79cfd27f4838a [2025-03-08 14:54:45,167 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:54:45,168 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:54:45,169 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:54:45,169 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:54:45,172 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:54:45,173 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:54:45" (1/1) ... [2025-03-08 14:54:45,174 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b68e43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:54:45, skipping insertion in model container [2025-03-08 14:54:45,174 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:54:45" (1/1) ... [2025-03-08 14:54:45,187 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:54:45,291 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-4.i[914,927] [2025-03-08 14:54:45,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:54:45,362 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:54:45,371 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-4.i[914,927] [2025-03-08 14:54:45,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:54:45,422 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:54:45,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:54:45 WrapperNode [2025-03-08 14:54:45,423 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:54:45,425 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:54:45,425 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:54:45,425 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:54:45,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:54:45" (1/1) ... [2025-03-08 14:54:45,438 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:54:45" (1/1) ... [2025-03-08 14:54:45,469 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 141 [2025-03-08 14:54:45,473 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:54:45,473 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:54:45,473 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:54:45,473 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:54:45,481 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:54:45" (1/1) ... [2025-03-08 14:54:45,481 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:54:45" (1/1) ... [2025-03-08 14:54:45,485 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:54:45" (1/1) ... [2025-03-08 14:54:45,503 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 14:54:45,505 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:54:45" (1/1) ... [2025-03-08 14:54:45,505 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:54:45" (1/1) ... [2025-03-08 14:54:45,510 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:54:45" (1/1) ... [2025-03-08 14:54:45,511 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:54:45" (1/1) ... [2025-03-08 14:54:45,512 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:54:45" (1/1) ... [2025-03-08 14:54:45,515 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:54:45" (1/1) ... [2025-03-08 14:54:45,517 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:54:45,519 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:54:45,519 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:54:45,519 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:54:45,520 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:54:45" (1/1) ... [2025-03-08 14:54:45,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:54:45,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:54:45,546 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 14:54:45,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 14:54:45,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:54:45,565 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:54:45,565 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:54:45,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 14:54:45,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:54:45,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:54:45,625 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:54:45,627 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:54:45,934 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-08 14:54:45,934 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:54:45,944 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:54:45,945 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:54:45,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:54:45 BoogieIcfgContainer [2025-03-08 14:54:45,946 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:54:45,949 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:54:45,949 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:54:45,952 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:54:45,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:54:45" (1/3) ... [2025-03-08 14:54:45,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43df04c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:54:45, skipping insertion in model container [2025-03-08 14:54:45,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:54:45" (2/3) ... [2025-03-08 14:54:45,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43df04c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:54:45, skipping insertion in model container [2025-03-08 14:54:45,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:54:45" (3/3) ... [2025-03-08 14:54:45,954 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-4.i [2025-03-08 14:54:45,964 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:54:45,966 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-while_file-4.i that has 2 procedures, 63 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:54:46,013 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:54:46,022 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;@3b131e28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:54:46,022 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:54:46,026 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 40 states have (on average 1.375) internal successors, (55), 41 states have internal predecessors, (55), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 14:54:46,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 14:54:46,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:54:46,038 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:54:46,038 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:54:46,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:54:46,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1425709298, now seen corresponding path program 1 times [2025-03-08 14:54:46,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:54:46,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760074130] [2025-03-08 14:54:46,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:54:46,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:54:46,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 14:54:46,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 14:54:46,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:54:46,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:54:46,295 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-08 14:54:46,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:54:46,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760074130] [2025-03-08 14:54:46,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760074130] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:54:46,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037144694] [2025-03-08 14:54:46,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:54:46,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:54:46,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:54:46,299 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:54:46,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 14:54:46,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 14:54:46,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 14:54:46,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:54:46,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:54:46,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:54:46,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:54:46,448 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-08 14:54:46,449 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:54:46,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037144694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:54:46,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:54:46,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 14:54:46,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659576576] [2025-03-08 14:54:46,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:54:46,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:54:46,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:54:46,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:54:46,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:54:46,470 INFO L87 Difference]: Start difference. First operand has 63 states, 40 states have (on average 1.375) internal successors, (55), 41 states have internal predecessors, (55), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 14:54:46,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:54:46,487 INFO L93 Difference]: Finished difference Result 120 states and 205 transitions. [2025-03-08 14:54:46,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:54:46,489 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 129 [2025-03-08 14:54:46,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:54:46,493 INFO L225 Difference]: With dead ends: 120 [2025-03-08 14:54:46,493 INFO L226 Difference]: Without dead ends: 60 [2025-03-08 14:54:46,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:54:46,497 INFO L435 NwaCegarLoop]: 89 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, 89 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:54:46,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:54:46,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-08 14:54:46,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-03-08 14:54:46,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 14:54:46,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 89 transitions. [2025-03-08 14:54:46,532 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 89 transitions. Word has length 129 [2025-03-08 14:54:46,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:54:46,532 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 89 transitions. [2025-03-08 14:54:46,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 14:54:46,533 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 89 transitions. [2025-03-08 14:54:46,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-08 14:54:46,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:54:46,536 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:54:46,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 14:54:46,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 14:54:46,739 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:54:46,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:54:46,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1302889807, now seen corresponding path program 1 times [2025-03-08 14:54:46,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:54:46,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925534742] [2025-03-08 14:54:46,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:54:46,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:54:46,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 14:54:46,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 14:54:46,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:54:46,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:54:47,672 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 14:54:47,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:54:47,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925534742] [2025-03-08 14:54:47,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925534742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:54:47,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:54:47,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 14:54:47,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203846986] [2025-03-08 14:54:47,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:54:47,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 14:54:47,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:54:47,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 14:54:47,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 14:54:47,674 INFO L87 Difference]: Start difference. First operand 60 states and 89 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 14:54:47,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:54:47,926 INFO L93 Difference]: Finished difference Result 201 states and 294 transitions. [2025-03-08 14:54:47,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 14:54:47,927 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 130 [2025-03-08 14:54:47,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:54:47,929 INFO L225 Difference]: With dead ends: 201 [2025-03-08 14:54:47,930 INFO L226 Difference]: Without dead ends: 144 [2025-03-08 14:54:47,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 14:54:47,931 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 134 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 14:54:47,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 335 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 14:54:47,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-08 14:54:47,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 119. [2025-03-08 14:54:47,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 76 states have (on average 1.2894736842105263) internal successors, (98), 76 states have internal predecessors, (98), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-08 14:54:47,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 178 transitions. [2025-03-08 14:54:47,956 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 178 transitions. Word has length 130 [2025-03-08 14:54:47,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:54:47,956 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 178 transitions. [2025-03-08 14:54:47,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 14:54:47,957 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 178 transitions. [2025-03-08 14:54:47,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-08 14:54:47,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:54:47,958 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:54:47,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 14:54:47,958 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:54:47,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:54:47,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1301966286, now seen corresponding path program 1 times [2025-03-08 14:54:47,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:54:47,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851982564] [2025-03-08 14:54:47,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:54:47,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:54:47,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 14:54:48,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 14:54:48,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:54:48,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:54:52,224 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 14:54:52,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:54:52,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851982564] [2025-03-08 14:54:52,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851982564] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:54:52,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:54:52,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 14:54:52,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638938937] [2025-03-08 14:54:52,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:54:52,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 14:54:52,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:54:52,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 14:54:52,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-08 14:54:52,227 INFO L87 Difference]: Start difference. First operand 119 states and 178 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 14:54:53,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:54:53,091 INFO L93 Difference]: Finished difference Result 401 states and 585 transitions. [2025-03-08 14:54:53,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 14:54:53,093 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 130 [2025-03-08 14:54:53,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:54:53,095 INFO L225 Difference]: With dead ends: 401 [2025-03-08 14:54:53,095 INFO L226 Difference]: Without dead ends: 285 [2025-03-08 14:54:53,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-03-08 14:54:53,100 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 186 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 14:54:53,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 440 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 14:54:53,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-03-08 14:54:53,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 190. [2025-03-08 14:54:53,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 125 states have (on average 1.272) internal successors, (159), 125 states have internal predecessors, (159), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-08 14:54:53,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 279 transitions. [2025-03-08 14:54:53,130 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 279 transitions. Word has length 130 [2025-03-08 14:54:53,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:54:53,131 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 279 transitions. [2025-03-08 14:54:53,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 14:54:53,131 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 279 transitions. [2025-03-08 14:54:53,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-08 14:54:53,132 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:54:53,132 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:54:53,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 14:54:53,133 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:54:53,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:54:53,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1172883567, now seen corresponding path program 1 times [2025-03-08 14:54:53,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:54:53,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468938103] [2025-03-08 14:54:53,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:54:53,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:54:53,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 14:54:53,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 14:54:53,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:54:53,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:54:53,277 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 14:54:53,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:54:53,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468938103] [2025-03-08 14:54:53,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468938103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:54:53,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:54:53,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 14:54:53,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957803320] [2025-03-08 14:54:53,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:54:53,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 14:54:53,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:54:53,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 14:54:53,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 14:54:53,279 INFO L87 Difference]: Start difference. First operand 190 states and 279 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 14:54:53,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:54:53,339 INFO L93 Difference]: Finished difference Result 429 states and 638 transitions. [2025-03-08 14:54:53,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 14:54:53,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 130 [2025-03-08 14:54:53,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:54:53,344 INFO L225 Difference]: With dead ends: 429 [2025-03-08 14:54:53,345 INFO L226 Difference]: Without dead ends: 306 [2025-03-08 14:54:53,346 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-08 14:54:53,348 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 47 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:54:53,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 174 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:54:53,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-03-08 14:54:53,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2025-03-08 14:54:53,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 197 states have (on average 1.263959390862944) internal successors, (249), 197 states have internal predecessors, (249), 100 states have call successors, (100), 6 states have call predecessors, (100), 6 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-08 14:54:53,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 449 transitions. [2025-03-08 14:54:53,400 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 449 transitions. Word has length 130 [2025-03-08 14:54:53,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:54:53,400 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 449 transitions. [2025-03-08 14:54:53,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 14:54:53,401 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 449 transitions. [2025-03-08 14:54:53,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 14:54:53,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:54:53,405 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:54:53,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 14:54:53,405 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:54:53,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:54:53,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1909563764, now seen corresponding path program 1 times [2025-03-08 14:54:53,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:54:53,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244668300] [2025-03-08 14:54:53,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:54:53,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:54:53,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 14:54:53,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 14:54:53,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:54:53,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:54:53,595 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-08 14:54:53,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:54:53,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244668300] [2025-03-08 14:54:53,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244668300] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:54:53,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494042362] [2025-03-08 14:54:53,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:54:53,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:54:53,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:54:53,598 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:54:53,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 14:54:53,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 14:54:53,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 14:54:53,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:54:53,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:54:53,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 14:54:53,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:54:53,854 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 217 proven. 48 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2025-03-08 14:54:53,856 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:54:54,017 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-08 14:54:54,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494042362] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 14:54:54,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 14:54:54,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-08 14:54:54,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798291762] [2025-03-08 14:54:54,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 14:54:54,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 14:54:54,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:54:54,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 14:54:54,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 14:54:54,020 INFO L87 Difference]: Start difference. First operand 304 states and 449 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2025-03-08 14:54:54,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:54:54,172 INFO L93 Difference]: Finished difference Result 563 states and 809 transitions. [2025-03-08 14:54:54,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 14:54:54,172 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) Word has length 131 [2025-03-08 14:54:54,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:54:54,174 INFO L225 Difference]: With dead ends: 563 [2025-03-08 14:54:54,175 INFO L226 Difference]: Without dead ends: 329 [2025-03-08 14:54:54,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 259 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-08 14:54:54,176 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 61 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 14:54:54,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 131 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 14:54:54,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2025-03-08 14:54:54,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 293. [2025-03-08 14:54:54,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 181 states have (on average 1.132596685082873) internal successors, (205), 181 states have internal predecessors, (205), 100 states have call successors, (100), 11 states have call predecessors, (100), 11 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-08 14:54:54,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 405 transitions. [2025-03-08 14:54:54,211 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 405 transitions. Word has length 131 [2025-03-08 14:54:54,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:54:54,212 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 405 transitions. [2025-03-08 14:54:54,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2025-03-08 14:54:54,212 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 405 transitions. [2025-03-08 14:54:54,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 14:54:54,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:54:54,214 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:54:54,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 14:54:54,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:54:54,418 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:54:54,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:54:54,419 INFO L85 PathProgramCache]: Analyzing trace with hash -559630220, now seen corresponding path program 1 times [2025-03-08 14:54:54,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:54:54,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972067847] [2025-03-08 14:54:54,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:54:54,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:54:54,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 14:54:54,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 14:54:54,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:54:54,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:54:54,533 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 14:54:54,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:54:54,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972067847] [2025-03-08 14:54:54,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972067847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:54:54,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:54:54,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 14:54:54,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854875283] [2025-03-08 14:54:54,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:54:54,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 14:54:54,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:54:54,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 14:54:54,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 14:54:54,535 INFO L87 Difference]: Start difference. First operand 293 states and 405 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 14:54:54,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:54:54,674 INFO L93 Difference]: Finished difference Result 520 states and 722 transitions. [2025-03-08 14:54:54,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 14:54:54,674 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 131 [2025-03-08 14:54:54,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:54:54,677 INFO L225 Difference]: With dead ends: 520 [2025-03-08 14:54:54,677 INFO L226 Difference]: Without dead ends: 403 [2025-03-08 14:54:54,678 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-08 14:54:54,678 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 84 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 14:54:54,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 299 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 14:54:54,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-03-08 14:54:54,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 399. [2025-03-08 14:54:54,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 243 states have (on average 1.1193415637860082) internal successors, (272), 243 states have internal predecessors, (272), 140 states have call successors, (140), 15 states have call predecessors, (140), 15 states have return successors, (140), 140 states have call predecessors, (140), 140 states have call successors, (140) [2025-03-08 14:54:54,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 552 transitions. [2025-03-08 14:54:54,741 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 552 transitions. Word has length 131 [2025-03-08 14:54:54,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:54:54,742 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 552 transitions. [2025-03-08 14:54:54,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 14:54:54,742 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 552 transitions. [2025-03-08 14:54:54,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 14:54:54,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:54:54,743 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:54:54,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 14:54:54,743 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:54:54,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:54:54,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1927882613, now seen corresponding path program 1 times [2025-03-08 14:54:54,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:54:54,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745627290] [2025-03-08 14:54:54,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:54:54,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:54:54,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 14:54:54,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 14:54:54,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:54:54,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:54:55,484 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 60 proven. 93 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2025-03-08 14:54:55,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:54:55,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745627290] [2025-03-08 14:54:55,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745627290] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:54:55,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803128341] [2025-03-08 14:54:55,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:54:55,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:54:55,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:54:55,487 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:54:55,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 14:54:55,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 14:54:55,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 14:54:55,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:54:55,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:54:55,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-08 14:54:55,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:54:56,619 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 367 proven. 111 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2025-03-08 14:54:56,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:54:57,262 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 48 proven. 63 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2025-03-08 14:54:57,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803128341] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 14:54:57,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 14:54:57,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 28 [2025-03-08 14:54:57,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019712238] [2025-03-08 14:54:57,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 14:54:57,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-08 14:54:57,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:54:57,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-08 14:54:57,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=607, Unknown=0, NotChecked=0, Total=756 [2025-03-08 14:54:57,266 INFO L87 Difference]: Start difference. First operand 399 states and 552 transitions. Second operand has 28 states, 27 states have (on average 3.5185185185185186) internal successors, (95), 26 states have internal predecessors, (95), 10 states have call successors, (60), 4 states have call predecessors, (60), 8 states have return successors, (60), 10 states have call predecessors, (60), 10 states have call successors, (60) [2025-03-08 14:54:59,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:54:59,883 INFO L93 Difference]: Finished difference Result 722 states and 921 transitions. [2025-03-08 14:54:59,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-03-08 14:54:59,884 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.5185185185185186) internal successors, (95), 26 states have internal predecessors, (95), 10 states have call successors, (60), 4 states have call predecessors, (60), 8 states have return successors, (60), 10 states have call predecessors, (60), 10 states have call successors, (60) Word has length 131 [2025-03-08 14:54:59,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:54:59,886 INFO L225 Difference]: With dead ends: 722 [2025-03-08 14:54:59,886 INFO L226 Difference]: Without dead ends: 490 [2025-03-08 14:54:59,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2331 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1987, Invalid=6203, Unknown=0, NotChecked=0, Total=8190 [2025-03-08 14:54:59,889 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 985 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 736 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 985 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 1537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 736 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 14:54:59,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [985 Valid, 446 Invalid, 1537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [736 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 14:54:59,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-03-08 14:54:59,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 332. [2025-03-08 14:54:59,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 214 states have (on average 1.088785046728972) internal successors, (233), 215 states have internal predecessors, (233), 88 states have call successors, (88), 29 states have call predecessors, (88), 29 states have return successors, (88), 87 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-08 14:54:59,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 409 transitions. [2025-03-08 14:54:59,938 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 409 transitions. Word has length 131 [2025-03-08 14:54:59,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:54:59,940 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 409 transitions. [2025-03-08 14:54:59,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.5185185185185186) internal successors, (95), 26 states have internal predecessors, (95), 10 states have call successors, (60), 4 states have call predecessors, (60), 8 states have return successors, (60), 10 states have call predecessors, (60), 10 states have call successors, (60) [2025-03-08 14:54:59,940 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 409 transitions. [2025-03-08 14:54:59,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 14:54:59,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:54:59,941 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:54:59,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 14:55:00,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:55:00,142 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:55:00,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:55:00,143 INFO L85 PathProgramCache]: Analyzing trace with hash -616557902, now seen corresponding path program 1 times [2025-03-08 14:55:00,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:55:00,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445000082] [2025-03-08 14:55:00,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:55:00,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:55:00,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 14:55:00,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 14:55:00,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:55:00,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:55:00,319 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 3 proven. 54 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-08 14:55:00,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:55:00,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445000082] [2025-03-08 14:55:00,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445000082] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:55:00,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146297557] [2025-03-08 14:55:00,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:55:00,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:55:00,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:55:00,323 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:55:00,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 14:55:00,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 14:55:00,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 14:55:00,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:55:00,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:55:00,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 14:55:00,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:55:00,571 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 93 proven. 54 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2025-03-08 14:55:00,571 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:55:00,716 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 3 proven. 54 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-08 14:55:00,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146297557] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 14:55:00,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 14:55:00,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2025-03-08 14:55:00,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591104714] [2025-03-08 14:55:00,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 14:55:00,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 14:55:00,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:55:00,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 14:55:00,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 14:55:00,718 INFO L87 Difference]: Start difference. First operand 332 states and 409 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2025-03-08 14:55:01,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:55:01,034 INFO L93 Difference]: Finished difference Result 769 states and 928 transitions. [2025-03-08 14:55:01,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 14:55:01,035 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 131 [2025-03-08 14:55:01,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:55:01,038 INFO L225 Difference]: With dead ends: 769 [2025-03-08 14:55:01,038 INFO L226 Difference]: Without dead ends: 506 [2025-03-08 14:55:01,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 257 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2025-03-08 14:55:01,043 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 68 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 14:55:01,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 352 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 14:55:01,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-03-08 14:55:01,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 352. [2025-03-08 14:55:01,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 231 states have (on average 1.0822510822510822) internal successors, (250), 232 states have internal predecessors, (250), 88 states have call successors, (88), 32 states have call predecessors, (88), 32 states have return successors, (88), 87 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-08 14:55:01,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 426 transitions. [2025-03-08 14:55:01,096 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 426 transitions. Word has length 131 [2025-03-08 14:55:01,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:55:01,096 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 426 transitions. [2025-03-08 14:55:01,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2025-03-08 14:55:01,096 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 426 transitions. [2025-03-08 14:55:01,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 14:55:01,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:55:01,097 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:55:01,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 14:55:01,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:55:01,298 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:55:01,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:55:01,298 INFO L85 PathProgramCache]: Analyzing trace with hash -615634381, now seen corresponding path program 1 times [2025-03-08 14:55:01,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:55:01,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922167852] [2025-03-08 14:55:01,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:55:01,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:55:01,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 14:55:01,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 14:55:01,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:55:01,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:55:01,374 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 14:55:01,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:55:01,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922167852] [2025-03-08 14:55:01,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922167852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:55:01,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:55:01,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 14:55:01,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361196824] [2025-03-08 14:55:01,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:55:01,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 14:55:01,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:55:01,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 14:55:01,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 14:55:01,376 INFO L87 Difference]: Start difference. First operand 352 states and 426 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 14:55:01,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:55:01,415 INFO L93 Difference]: Finished difference Result 563 states and 681 transitions. [2025-03-08 14:55:01,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 14:55:01,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 131 [2025-03-08 14:55:01,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:55:01,418 INFO L225 Difference]: With dead ends: 563 [2025-03-08 14:55:01,418 INFO L226 Difference]: Without dead ends: 268 [2025-03-08 14:55:01,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 14:55:01,419 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 74 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:55:01,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 76 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:55:01,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-03-08 14:55:01,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2025-03-08 14:55:01,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 174 states have (on average 1.0574712643678161) internal successors, (184), 175 states have internal predecessors, (184), 68 states have call successors, (68), 25 states have call predecessors, (68), 25 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-08 14:55:01,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 320 transitions. [2025-03-08 14:55:01,468 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 320 transitions. Word has length 131 [2025-03-08 14:55:01,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:55:01,469 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 320 transitions. [2025-03-08 14:55:01,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 14:55:01,469 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 320 transitions. [2025-03-08 14:55:01,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 14:55:01,470 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:55:01,470 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:55:01,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 14:55:01,470 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:55:01,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:55:01,470 INFO L85 PathProgramCache]: Analyzing trace with hash -758177645, now seen corresponding path program 1 times [2025-03-08 14:55:01,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:55:01,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684855937] [2025-03-08 14:55:01,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:55:01,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:55:01,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 14:55:01,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 14:55:01,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:55:01,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 14:55:01,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [907658326] [2025-03-08 14:55:01,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:55:01,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:55:01,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:55:01,538 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:55:01,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 14:55:01,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 14:55:01,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 14:55:01,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:55:01,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:55:01,721 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 14:55:01,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 14:55:01,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 14:55:01,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:55:01,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:55:01,811 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 14:55:01,812 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 14:55:01,813 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 14:55:01,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 14:55:02,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 14:55:02,022 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:55:02,084 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 14:55:02,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 02:55:02 BoogieIcfgContainer [2025-03-08 14:55:02,089 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 14:55:02,089 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 14:55:02,089 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 14:55:02,089 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 14:55:02,090 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:54:45" (3/4) ... [2025-03-08 14:55:02,091 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 14:55:02,092 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 14:55:02,093 INFO L158 Benchmark]: Toolchain (without parser) took 16925.05ms. Allocated memory was 201.3MB in the beginning and 402.7MB in the end (delta: 201.3MB). Free memory was 154.3MB in the beginning and 269.6MB in the end (delta: -115.3MB). Peak memory consumption was 85.2MB. Max. memory is 16.1GB. [2025-03-08 14:55:02,093 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 118.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:55:02,093 INFO L158 Benchmark]: CACSL2BoogieTranslator took 255.80ms. Allocated memory is still 201.3MB. Free memory was 154.0MB in the beginning and 140.3MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 14:55:02,093 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.98ms. Allocated memory is still 201.3MB. Free memory was 140.3MB in the beginning and 137.6MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:55:02,094 INFO L158 Benchmark]: Boogie Preprocessor took 45.22ms. Allocated memory is still 201.3MB. Free memory was 137.6MB in the beginning and 134.5MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:55:02,094 INFO L158 Benchmark]: IcfgBuilder took 427.02ms. Allocated memory is still 201.3MB. Free memory was 134.5MB in the beginning and 112.9MB in the end (delta: 21.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 14:55:02,094 INFO L158 Benchmark]: TraceAbstraction took 16140.15ms. Allocated memory was 201.3MB in the beginning and 402.7MB in the end (delta: 201.3MB). Free memory was 112.2MB in the beginning and 269.7MB in the end (delta: -157.5MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. [2025-03-08 14:55:02,094 INFO L158 Benchmark]: Witness Printer took 2.77ms. Allocated memory is still 402.7MB. Free memory was 269.7MB in the beginning and 269.6MB in the end (delta: 124.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:55:02,095 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.21ms. Allocated memory is still 201.3MB. Free memory is still 118.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 255.80ms. Allocated memory is still 201.3MB. Free memory was 154.0MB in the beginning and 140.3MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.98ms. Allocated memory is still 201.3MB. Free memory was 140.3MB in the beginning and 137.6MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.22ms. Allocated memory is still 201.3MB. Free memory was 137.6MB in the beginning and 134.5MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 427.02ms. Allocated memory is still 201.3MB. Free memory was 134.5MB in the beginning and 112.9MB in the end (delta: 21.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 16140.15ms. Allocated memory was 201.3MB in the beginning and 402.7MB in the end (delta: 201.3MB). Free memory was 112.2MB in the beginning and 269.7MB in the end (delta: -157.5MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. * Witness Printer took 2.77ms. Allocated memory is still 402.7MB. Free memory was 269.7MB in the beginning and 269.6MB in the end (delta: 124.5kB). 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 85, overapproximation of someBinaryDOUBLEComparisonOperation at line 104, overapproximation of someBinaryDOUBLEComparisonOperation at line 131, overapproximation of someBinaryDOUBLEComparisonOperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 102. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_5 = 0; [L25] unsigned short int var_1_6 = 4; [L26] unsigned short int var_1_9 = 4; [L27] unsigned short int var_1_10 = 10; [L28] double var_1_11 = 15.6; [L29] double var_1_12 = 256.4; [L30] double var_1_13 = 49.15; [L31] unsigned long int var_1_14 = 500; [L32] unsigned long int var_1_15 = 2173307753; [L33] unsigned long int var_1_16 = 3362224480; [L34] signed short int var_1_17 = 16; [L35] signed short int var_1_19 = 16; [L36] signed short int var_1_20 = 4; [L37] signed short int var_1_21 = 0; [L38] signed short int var_1_22 = -25; [L39] unsigned short int last_1_var_1_6 = 4; [L40] unsigned short int last_1_var_1_9 = 4; [L41] unsigned long int last_1_var_1_14 = 500; [L42] signed short int last_1_var_1_17 = 16; VAL [isInitial=0, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L135] isInitial = 1 [L136] FCALL initially() [L137] COND TRUE 1 [L138] CALL updateLastVariables() [L125] last_1_var_1_6 = var_1_6 [L126] last_1_var_1_9 = var_1_9 [L127] last_1_var_1_14 = var_1_14 [L128] last_1_var_1_17 = var_1_17 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L138] RET updateLastVariables() [L139] CALL updateVariables() [L92] var_1_4 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_5=0, var_1_6=4, var_1_9=4] [L93] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_5=0, var_1_6=4, var_1_9=4] [L94] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L94] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L95] var_1_5 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_6=4, var_1_9=4] [L96] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_6=4, var_1_9=4] [L97] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L97] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L98] var_1_10 = __VERIFIER_nondet_ushort() [L99] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L99] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L100] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L100] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L101] var_1_12 = __VERIFIER_nondet_double() [L102] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L102] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L103] var_1_13 = __VERIFIER_nondet_double() [L104] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L104] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L105] var_1_15 = __VERIFIER_nondet_ulong() [L106] CALL assume_abort_if_not(var_1_15 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L106] RET assume_abort_if_not(var_1_15 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L107] CALL assume_abort_if_not(var_1_15 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L107] RET assume_abort_if_not(var_1_15 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L108] var_1_16 = __VERIFIER_nondet_ulong() [L109] CALL assume_abort_if_not(var_1_16 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L109] RET assume_abort_if_not(var_1_16 >= 3221225470) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L110] CALL assume_abort_if_not(var_1_16 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L110] RET assume_abort_if_not(var_1_16 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L111] var_1_19 = __VERIFIER_nondet_short() [L112] CALL assume_abort_if_not(var_1_19 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L112] RET assume_abort_if_not(var_1_19 >= -16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L113] CALL assume_abort_if_not(var_1_19 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L113] RET assume_abort_if_not(var_1_19 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L114] var_1_20 = __VERIFIER_nondet_short() [L115] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L115] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L116] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L116] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L117] var_1_21 = __VERIFIER_nondet_short() [L118] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L118] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L119] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L119] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L120] var_1_22 = __VERIFIER_nondet_short() [L121] CALL assume_abort_if_not(var_1_22 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L121] RET assume_abort_if_not(var_1_22 >= -16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L122] CALL assume_abort_if_not(var_1_22 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L122] RET assume_abort_if_not(var_1_22 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L139] RET updateVariables() [L140] CALL step() [L46] signed long int stepLocal_0 = last_1_var_1_9; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L47] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L52] signed long int stepLocal_3 = last_1_var_1_9; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_3=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L53] COND TRUE last_1_var_1_14 >= stepLocal_3 [L54] var_1_14 = (((((var_1_15) > ((var_1_16 - var_1_10))) ? (var_1_15) : ((var_1_16 - var_1_10)))) - last_1_var_1_17) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L56] COND TRUE var_1_6 <= var_1_14 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L57] COND TRUE (- var_1_14) > var_1_6 [L58] var_1_1 = 0 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L63] unsigned char stepLocal_2 = var_1_4; [L64] unsigned long int stepLocal_1 = var_1_14; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_1=3221225454, stepLocal_2=0, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L65] COND FALSE !(stepLocal_2 || var_1_1) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_1=3221225454, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L68] COND TRUE stepLocal_1 >= var_1_6 [L69] var_1_9 = var_1_10 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L74] unsigned char stepLocal_5 = var_1_1; [L75] unsigned char stepLocal_4 = var_1_1; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_4=0, stepLocal_5=0, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L76] COND FALSE !(stepLocal_4 && (var_1_5 && (var_1_12 < var_1_13))) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L83] COND TRUE var_1_14 <= var_1_14 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L84] COND TRUE ! var_1_1 [L85] var_1_11 = (var_1_12 - var_1_13) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_14=3221225454, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L140] RET step() [L141] CALL, EXPR property() [L131-L132] return ((((((var_1_6 <= var_1_14) ? (((- var_1_14) > var_1_6) ? (var_1_1 == ((unsigned char) 0)) : 1) : (var_1_1 == ((unsigned char) (var_1_4 || var_1_5)))) && (var_1_5 ? (((last_1_var_1_14 * (last_1_var_1_6 + last_1_var_1_17)) > last_1_var_1_9) ? (var_1_6 == ((unsigned short int) 256)) : 1) : 1)) && ((var_1_4 || var_1_1) ? (var_1_9 == ((unsigned short int) ((((32) < (var_1_10)) ? (32) : (var_1_10))))) : ((var_1_14 >= var_1_6) ? (var_1_9 == ((unsigned short int) var_1_10)) : (var_1_9 == ((unsigned short int) var_1_10))))) && ((var_1_14 <= var_1_14) ? ((! var_1_1) ? (var_1_11 == ((double) (var_1_12 - var_1_13))) : 1) : (var_1_11 == ((double) var_1_12)))) && ((last_1_var_1_14 >= last_1_var_1_9) ? (var_1_14 == ((unsigned long int) (((((var_1_15) > ((var_1_16 - var_1_10))) ? (var_1_15) : ((var_1_16 - var_1_10)))) - last_1_var_1_17))) : 1)) && ((var_1_1 && (var_1_5 && (var_1_12 < var_1_13))) ? ((var_1_1 || (last_1_var_1_17 >= ((((var_1_14) > (var_1_6)) ? (var_1_14) : (var_1_6))))) ? (var_1_17 == ((signed short int) (((((((((var_1_19) > (256)) ? (var_1_19) : (256))) + (var_1_20 - var_1_21))) < ((var_1_22 + 64))) ? ((((((var_1_19) > (256)) ? (var_1_19) : (256))) + (var_1_20 - var_1_21))) : ((var_1_22 + 64)))))) : (var_1_17 == ((signed short int) var_1_19))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_14=3221225454, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L141] RET, EXPR property() [L141] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_14=3221225454, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_14=3221225454, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 63 locations, 115 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.0s, OverallIterations: 10, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1643 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1639 mSDsluCounter, 2342 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1478 mSDsCounter, 871 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1739 IncrementalHoareTripleChecker+Invalid, 2610 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 871 mSolverCounterUnsat, 864 mSDtfsCounter, 1739 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1078 GetRequests, 933 SyntacticMatches, 5 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2419 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=399occurred in iteration=6, InterpolantAutomatonStates: 123, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 474 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 1960 NumberOfCodeBlocks, 1960 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2073 ConstructedInterpolants, 0 QuantifiedInterpolants, 10529 SizeOfPredicates, 18 NumberOfNonLiveVariables, 1248 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 11549/12160 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 14:55:02,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-4.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 fb80e4f0533bc0d87718a3c946d158e7005d734d62d8e11c16c799aba4b0f82b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:55:03,884 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:55:03,962 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 14:55:03,968 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:55:03,968 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:55:03,990 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:55:03,991 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:55:03,991 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:55:03,991 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:55:03,991 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:55:03,991 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:55:03,991 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:55:03,991 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:55:03,991 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:55:03,991 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:55:03,991 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:55:03,991 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:55:03,992 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:55:03,992 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:55:03,992 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:55:03,992 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:55:03,992 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:55:03,992 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:55:03,992 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 14:55:03,992 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 14:55:03,992 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 14:55:03,992 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:55:03,992 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:55:03,992 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:55:03,992 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:55:03,992 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:55:03,992 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:55:03,992 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:55:03,994 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:55:03,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:55:03,994 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:55:03,994 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:55:03,994 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:55:03,994 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:55:03,994 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 14:55:03,994 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 14:55:03,994 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:55:03,994 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:55:03,995 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:55:03,995 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:55:03,995 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 -> fb80e4f0533bc0d87718a3c946d158e7005d734d62d8e11c16c799aba4b0f82b [2025-03-08 14:55:04,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:55:04,241 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:55:04,242 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:55:04,243 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:55:04,245 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:55:04,246 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-4.i [2025-03-08 14:55:05,375 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a1ca4c87/ca60576d162e49c3b58b1b8c2bdb9360/FLAG3fbe552f4 [2025-03-08 14:55:05,535 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:55:05,535 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-4.i [2025-03-08 14:55:05,540 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a1ca4c87/ca60576d162e49c3b58b1b8c2bdb9360/FLAG3fbe552f4 [2025-03-08 14:55:05,928 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a1ca4c87/ca60576d162e49c3b58b1b8c2bdb9360 [2025-03-08 14:55:05,929 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:55:05,930 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:55:05,931 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:55:05,931 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:55:05,934 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:55:05,935 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:55:05" (1/1) ... [2025-03-08 14:55:05,935 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b5b4ac1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:55:05, skipping insertion in model container [2025-03-08 14:55:05,935 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:55:05" (1/1) ... [2025-03-08 14:55:05,947 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:55:06,038 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-4.i[914,927] [2025-03-08 14:55:06,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:55:06,090 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:55:06,097 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-4.i[914,927] [2025-03-08 14:55:06,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:55:06,124 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:55:06,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:55:06 WrapperNode [2025-03-08 14:55:06,125 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:55:06,125 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:55:06,126 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:55:06,126 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:55:06,130 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:55:06" (1/1) ... [2025-03-08 14:55:06,136 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:55:06" (1/1) ... [2025-03-08 14:55:06,156 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 137 [2025-03-08 14:55:06,156 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:55:06,158 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:55:06,158 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:55:06,158 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:55:06,164 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:55:06" (1/1) ... [2025-03-08 14:55:06,164 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:55:06" (1/1) ... [2025-03-08 14:55:06,166 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:55:06" (1/1) ... [2025-03-08 14:55:06,174 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 14:55:06,175 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:55:06" (1/1) ... [2025-03-08 14:55:06,175 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:55:06" (1/1) ... [2025-03-08 14:55:06,180 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:55:06" (1/1) ... [2025-03-08 14:55:06,181 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:55:06" (1/1) ... [2025-03-08 14:55:06,186 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:55:06" (1/1) ... [2025-03-08 14:55:06,186 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:55:06" (1/1) ... [2025-03-08 14:55:06,190 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:55:06,191 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:55:06,191 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:55:06,191 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:55:06,192 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:55:06" (1/1) ... [2025-03-08 14:55:06,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:55:06,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:55:06,214 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 14:55:06,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 14:55:06,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:55:06,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 14:55:06,235 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:55:06,235 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:55:06,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:55:06,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:55:06,303 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:55:06,305 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:55:06,969 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-08 14:55:06,969 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:55:06,977 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:55:06,977 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:55:06,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:55:06 BoogieIcfgContainer [2025-03-08 14:55:06,978 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:55:06,980 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:55:06,980 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:55:06,984 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:55:06,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:55:05" (1/3) ... [2025-03-08 14:55:06,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@546e9bb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:55:06, skipping insertion in model container [2025-03-08 14:55:06,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:55:06" (2/3) ... [2025-03-08 14:55:06,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@546e9bb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:55:06, skipping insertion in model container [2025-03-08 14:55:06,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:55:06" (3/3) ... [2025-03-08 14:55:06,986 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-4.i [2025-03-08 14:55:07,009 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:55:07,011 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-while_file-4.i that has 2 procedures, 63 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:55:07,053 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:55:07,064 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;@75b63368, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:55:07,064 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:55:07,069 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 40 states have (on average 1.375) internal successors, (55), 41 states have internal predecessors, (55), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 14:55:07,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 14:55:07,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:55:07,078 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:55:07,079 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:55:07,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:55:07,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1425709298, now seen corresponding path program 1 times [2025-03-08 14:55:07,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:55:07,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2130027024] [2025-03-08 14:55:07,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:55:07,094 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:55:07,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:55:07,099 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:55:07,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 14:55:07,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 14:55:07,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 14:55:07,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:55:07,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:55:07,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:55:07,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:55:07,359 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2025-03-08 14:55:07,359 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:55:07,361 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:55:07,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2130027024] [2025-03-08 14:55:07,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2130027024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:55:07,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:55:07,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 14:55:07,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865660552] [2025-03-08 14:55:07,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:55:07,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:55:07,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:55:07,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:55:07,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:55:07,383 INFO L87 Difference]: Start difference. First operand has 63 states, 40 states have (on average 1.375) internal successors, (55), 41 states have internal predecessors, (55), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 14:55:07,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:55:07,405 INFO L93 Difference]: Finished difference Result 120 states and 205 transitions. [2025-03-08 14:55:07,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:55:07,407 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 129 [2025-03-08 14:55:07,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:55:07,414 INFO L225 Difference]: With dead ends: 120 [2025-03-08 14:55:07,414 INFO L226 Difference]: Without dead ends: 60 [2025-03-08 14:55:07,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:55:07,419 INFO L435 NwaCegarLoop]: 89 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, 89 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:55:07,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:55:07,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-08 14:55:07,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-03-08 14:55:07,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 14:55:07,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 89 transitions. [2025-03-08 14:55:07,453 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 89 transitions. Word has length 129 [2025-03-08 14:55:07,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:55:07,453 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 89 transitions. [2025-03-08 14:55:07,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 14:55:07,454 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 89 transitions. [2025-03-08 14:55:07,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-08 14:55:07,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:55:07,458 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:55:07,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 14:55:07,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:55:07,659 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:55:07,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:55:07,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1302889807, now seen corresponding path program 1 times [2025-03-08 14:55:07,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:55:07,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1839260808] [2025-03-08 14:55:07,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:55:07,660 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:55:07,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:55:07,663 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:55:07,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 14:55:07,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 14:55:07,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 14:55:07,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:55:07,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:55:07,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 14:55:07,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:55:08,582 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 179 proven. 99 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2025-03-08 14:55:08,582 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:55:09,000 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 102 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2025-03-08 14:55:09,000 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:55:09,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1839260808] [2025-03-08 14:55:09,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1839260808] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 14:55:09,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 14:55:09,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2025-03-08 14:55:09,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227704873] [2025-03-08 14:55:09,000 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 14:55:09,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 14:55:09,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:55:09,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 14:55:09,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-03-08 14:55:09,002 INFO L87 Difference]: Start difference. First operand 60 states and 89 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 3 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) [2025-03-08 14:55:09,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:55:09,839 INFO L93 Difference]: Finished difference Result 143 states and 200 transitions. [2025-03-08 14:55:09,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 14:55:09,840 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 3 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) Word has length 130 [2025-03-08 14:55:09,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:55:09,842 INFO L225 Difference]: With dead ends: 143 [2025-03-08 14:55:09,842 INFO L226 Difference]: Without dead ends: 86 [2025-03-08 14:55:09,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 245 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2025-03-08 14:55:09,843 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 58 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 14:55:09,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 228 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 14:55:09,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-08 14:55:09,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 72. [2025-03-08 14:55:09,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 48 states have internal predecessors, (55), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 14:55:09,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 95 transitions. [2025-03-08 14:55:09,853 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 95 transitions. Word has length 130 [2025-03-08 14:55:09,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:55:09,854 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 95 transitions. [2025-03-08 14:55:09,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 3 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) [2025-03-08 14:55:09,854 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 95 transitions. [2025-03-08 14:55:09,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 14:55:09,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:55:09,855 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:55:09,862 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-03-08 14:55:10,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:55:10,059 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:55:10,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:55:10,060 INFO L85 PathProgramCache]: Analyzing trace with hash -559630220, now seen corresponding path program 1 times [2025-03-08 14:55:10,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:55:10,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [358998006] [2025-03-08 14:55:10,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:55:10,060 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:55:10,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:55:10,062 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:55:10,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 14:55:10,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 14:55:10,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 14:55:10,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:55:10,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:55:10,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 14:55:10,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:55:10,425 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 14:55:10,426 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:55:10,426 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:55:10,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [358998006] [2025-03-08 14:55:10,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [358998006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:55:10,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:55:10,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 14:55:10,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386744955] [2025-03-08 14:55:10,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:55:10,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 14:55:10,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:55:10,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 14:55:10,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 14:55:10,428 INFO L87 Difference]: Start difference. First operand 72 states and 95 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 14:55:10,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:55:10,962 INFO L93 Difference]: Finished difference Result 203 states and 269 transitions. [2025-03-08 14:55:10,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 14:55:10,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 131 [2025-03-08 14:55:10,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:55:10,964 INFO L225 Difference]: With dead ends: 203 [2025-03-08 14:55:10,964 INFO L226 Difference]: Without dead ends: 134 [2025-03-08 14:55:10,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-08 14:55:10,966 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 92 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 14:55:10,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 212 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 14:55:10,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-08 14:55:10,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2025-03-08 14:55:10,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 85 states have (on average 1.1058823529411765) internal successors, (94), 85 states have internal predecessors, (94), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-08 14:55:10,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 174 transitions. [2025-03-08 14:55:10,989 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 174 transitions. Word has length 131 [2025-03-08 14:55:10,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:55:10,989 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 174 transitions. [2025-03-08 14:55:10,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 14:55:10,989 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 174 transitions. [2025-03-08 14:55:10,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 14:55:10,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:55:10,992 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:55:10,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-08 14:55:11,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:55:11,192 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:55:11,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:55:11,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1927882613, now seen corresponding path program 1 times [2025-03-08 14:55:11,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:55:11,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1645896053] [2025-03-08 14:55:11,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:55:11,193 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:55:11,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:55:11,195 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:55:11,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-08 14:55:11,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 14:55:11,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 14:55:11,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:55:11,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:55:11,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 14:55:11,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:55:12,035 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 387 proven. 33 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2025-03-08 14:55:12,035 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:55:12,171 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:55:12,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1645896053] [2025-03-08 14:55:12,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1645896053] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:55:12,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1620958615] [2025-03-08 14:55:12,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:55:12,172 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 14:55:12,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 14:55:12,174 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 14:55:12,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-03-08 14:55:12,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 14:55:12,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 14:55:12,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:55:12,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:55:12,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 14:55:12,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:55:13,336 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 438 proven. 57 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2025-03-08 14:55:13,337 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:55:13,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1620958615] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:55:13,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 14:55:13,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 16 [2025-03-08 14:55:13,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530049732] [2025-03-08 14:55:13,581 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 14:55:13,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 14:55:13,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:55:13,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 14:55:13,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2025-03-08 14:55:13,583 INFO L87 Difference]: Start difference. First operand 132 states and 174 transitions. Second operand has 17 states, 17 states have (on average 4.411764705882353) internal successors, (75), 16 states have internal predecessors, (75), 5 states have call successors, (40), 5 states have call predecessors, (40), 8 states have return successors, (40), 5 states have call predecessors, (40), 5 states have call successors, (40) [2025-03-08 14:55:16,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:55:16,143 INFO L93 Difference]: Finished difference Result 366 states and 465 transitions. [2025-03-08 14:55:16,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 14:55:16,144 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.411764705882353) internal successors, (75), 16 states have internal predecessors, (75), 5 states have call successors, (40), 5 states have call predecessors, (40), 8 states have return successors, (40), 5 states have call predecessors, (40), 5 states have call successors, (40) Word has length 131 [2025-03-08 14:55:16,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:55:16,147 INFO L225 Difference]: With dead ends: 366 [2025-03-08 14:55:16,147 INFO L226 Difference]: Without dead ends: 237 [2025-03-08 14:55:16,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=444, Invalid=1196, Unknown=0, NotChecked=0, Total=1640 [2025-03-08 14:55:16,150 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 242 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 14:55:16,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 349 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 14:55:16,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-03-08 14:55:16,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 217. [2025-03-08 14:55:16,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 141 states have (on average 1.0851063829787233) internal successors, (153), 141 states have internal predecessors, (153), 60 states have call successors, (60), 15 states have call predecessors, (60), 15 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-08 14:55:16,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 273 transitions. [2025-03-08 14:55:16,186 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 273 transitions. Word has length 131 [2025-03-08 14:55:16,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:55:16,186 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 273 transitions. [2025-03-08 14:55:16,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.411764705882353) internal successors, (75), 16 states have internal predecessors, (75), 5 states have call successors, (40), 5 states have call predecessors, (40), 8 states have return successors, (40), 5 states have call predecessors, (40), 5 states have call successors, (40) [2025-03-08 14:55:16,186 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 273 transitions. [2025-03-08 14:55:16,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 14:55:16,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:55:16,189 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:55:16,196 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 (5)] Ended with exit code 0 [2025-03-08 14:55:16,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2025-03-08 14:55:16,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-08 14:55:16,590 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:55:16,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:55:16,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1634479606, now seen corresponding path program 1 times [2025-03-08 14:55:16,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:55:16,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [581339008] [2025-03-08 14:55:16,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:55:16,591 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:55:16,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:55:16,594 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:55:16,595 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 (7)] Waiting until timeout for monitored process [2025-03-08 14:55:16,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 14:55:16,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 14:55:16,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:55:16,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:55:16,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 14:55:16,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:55:17,101 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 14:55:17,101 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:55:17,101 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:55:17,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [581339008] [2025-03-08 14:55:17,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [581339008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:55:17,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:55:17,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 14:55:17,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504012720] [2025-03-08 14:55:17,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:55:17,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 14:55:17,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:55:17,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 14:55:17,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 14:55:17,103 INFO L87 Difference]: Start difference. First operand 217 states and 273 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 14:55:17,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:55:17,530 INFO L93 Difference]: Finished difference Result 360 states and 450 transitions. [2025-03-08 14:55:17,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 14:55:17,539 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 131 [2025-03-08 14:55:17,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:55:17,541 INFO L225 Difference]: With dead ends: 360 [2025-03-08 14:55:17,541 INFO L226 Difference]: Without dead ends: 146 [2025-03-08 14:55:17,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 14:55:17,542 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 38 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 14:55:17,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 243 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 14:55:17,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-08 14:55:17,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 130. [2025-03-08 14:55:17,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 79 states have (on average 1.0379746835443038) internal successors, (82), 79 states have internal predecessors, (82), 40 states have call successors, (40), 10 states have call predecessors, (40), 10 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-08 14:55:17,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 162 transitions. [2025-03-08 14:55:17,571 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 162 transitions. Word has length 131 [2025-03-08 14:55:17,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:55:17,572 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 162 transitions. [2025-03-08 14:55:17,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-08 14:55:17,572 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 162 transitions. [2025-03-08 14:55:17,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 14:55:17,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:55:17,573 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:55:17,580 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 (7)] Ended with exit code 0 [2025-03-08 14:55:17,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:55:17,773 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:55:17,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:55:17,774 INFO L85 PathProgramCache]: Analyzing trace with hash -758177645, now seen corresponding path program 1 times [2025-03-08 14:55:17,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:55:17,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1982712508] [2025-03-08 14:55:17,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:55:17,774 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:55:17,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:55:17,776 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:55:17,777 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 (8)] Waiting until timeout for monitored process [2025-03-08 14:55:17,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 14:55:17,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 14:55:17,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:55:17,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:55:17,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 14:55:17,913 INFO L279 TraceCheckSpWp]: Computing forward predicates...