./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-59.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_codestructure_normal_file-59.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 e093e3889d1250dd6c4e72475f92fd634899e4114caa675b33a0cb0284b4d442 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:03:35,221 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:03:35,278 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 10:03:35,285 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:03:35,285 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:03:35,309 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:03:35,310 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:03:35,311 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:03:35,311 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:03:35,311 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:03:35,312 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:03:35,312 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:03:35,312 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:03:35,312 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:03:35,313 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:03:35,313 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:03:35,313 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:03:35,313 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:03:35,313 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 10:03:35,313 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:03:35,313 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:03:35,313 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:03:35,313 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:03:35,313 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:03:35,313 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:03:35,314 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:03:35,314 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:03:35,314 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:03:35,314 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:03:35,314 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:03:35,314 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:03:35,314 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:03:35,315 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:03:35,315 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:03:35,315 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:03:35,315 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:03:35,315 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:03:35,315 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 10:03:35,315 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 10:03:35,315 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:03:35,315 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:03:35,315 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:03:35,315 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:03:35,316 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 -> e093e3889d1250dd6c4e72475f92fd634899e4114caa675b33a0cb0284b4d442 [2025-03-08 10:03:35,572 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:03:35,582 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:03:35,585 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:03:35,585 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:03:35,586 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:03:35,587 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-59.i [2025-03-08 10:03:36,794 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af4fe975b/c29c30f5c4d4437e90576ee9cb551a55/FLAG741952f40 [2025-03-08 10:03:37,051 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:03:37,053 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-59.i [2025-03-08 10:03:37,061 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af4fe975b/c29c30f5c4d4437e90576ee9cb551a55/FLAG741952f40 [2025-03-08 10:03:37,369 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af4fe975b/c29c30f5c4d4437e90576ee9cb551a55 [2025-03-08 10:03:37,371 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:03:37,373 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:03:37,376 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:03:37,376 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:03:37,380 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:03:37,381 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:03:37" (1/1) ... [2025-03-08 10:03:37,381 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78fe62ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:37, skipping insertion in model container [2025-03-08 10:03:37,382 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:03:37" (1/1) ... [2025-03-08 10:03:37,397 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:03:37,500 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_codestructure_normal_file-59.i[913,926] [2025-03-08 10:03:37,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:03:37,556 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:03:37,564 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_codestructure_normal_file-59.i[913,926] [2025-03-08 10:03:37,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:03:37,598 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:03:37,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:37 WrapperNode [2025-03-08 10:03:37,599 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:03:37,600 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:03:37,600 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:03:37,600 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:03:37,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:37" (1/1) ... [2025-03-08 10:03:37,614 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:37" (1/1) ... [2025-03-08 10:03:37,647 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130 [2025-03-08 10:03:37,648 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:03:37,648 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:03:37,648 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:03:37,648 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:03:37,655 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:37" (1/1) ... [2025-03-08 10:03:37,656 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:37" (1/1) ... [2025-03-08 10:03:37,658 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:37" (1/1) ... [2025-03-08 10:03:37,679 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 10:03:37,679 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:37" (1/1) ... [2025-03-08 10:03:37,679 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:37" (1/1) ... [2025-03-08 10:03:37,685 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:37" (1/1) ... [2025-03-08 10:03:37,687 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:37" (1/1) ... [2025-03-08 10:03:37,689 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:37" (1/1) ... [2025-03-08 10:03:37,690 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:37" (1/1) ... [2025-03-08 10:03:37,692 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:03:37,693 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:03:37,693 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:03:37,693 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:03:37,694 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:37" (1/1) ... [2025-03-08 10:03:37,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:03:37,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:03:37,729 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 10:03:37,736 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 10:03:37,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:03:37,756 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:03:37,756 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:03:37,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 10:03:37,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:03:37,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:03:37,806 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:03:37,807 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:03:38,144 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 10:03:38,145 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:03:38,156 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:03:38,158 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:03:38,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:03:38 BoogieIcfgContainer [2025-03-08 10:03:38,158 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:03:38,160 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:03:38,160 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:03:38,164 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:03:38,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:03:37" (1/3) ... [2025-03-08 10:03:38,165 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57fb4ca4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:03:38, skipping insertion in model container [2025-03-08 10:03:38,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:37" (2/3) ... [2025-03-08 10:03:38,167 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57fb4ca4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:03:38, skipping insertion in model container [2025-03-08 10:03:38,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:03:38" (3/3) ... [2025-03-08 10:03:38,169 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-59.i [2025-03-08 10:03:38,185 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:03:38,186 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-59.i that has 2 procedures, 60 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:03:38,228 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:03:38,236 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;@2f106715, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:03:38,237 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:03:38,240 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 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 10:03:38,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 10:03:38,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:03:38,248 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] [2025-03-08 10:03:38,249 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:03:38,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:03:38,253 INFO L85 PathProgramCache]: Analyzing trace with hash -325798736, now seen corresponding path program 1 times [2025-03-08 10:03:38,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:03:38,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570490531] [2025-03-08 10:03:38,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:03:38,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:03:38,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 10:03:38,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 10:03:38,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:03:38,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:03:38,507 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 10:03:38,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:03:38,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570490531] [2025-03-08 10:03:38,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570490531] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:03:38,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586725144] [2025-03-08 10:03:38,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:03:38,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:03:38,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:03:38,512 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 10:03:38,515 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 10:03:38,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 10:03:38,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 10:03:38,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:03:38,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:03:38,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:03:38,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:03:38,710 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 10:03:38,712 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:03:38,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586725144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:03:38,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 10:03:38,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 10:03:38,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568988569] [2025-03-08 10:03:38,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:03:38,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:03:38,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:03:38,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:03:38,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:03:38,737 INFO L87 Difference]: Start difference. First operand has 60 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 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 15.5) internal successors, (31), 2 states have internal predecessors, (31), 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 10:03:38,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:03:38,758 INFO L93 Difference]: Finished difference Result 114 states and 197 transitions. [2025-03-08 10:03:38,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:03:38,760 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 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 126 [2025-03-08 10:03:38,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:03:38,764 INFO L225 Difference]: With dead ends: 114 [2025-03-08 10:03:38,766 INFO L226 Difference]: Without dead ends: 57 [2025-03-08 10:03:38,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 127 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 10:03:38,770 INFO L435 NwaCegarLoop]: 86 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, 86 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 10:03:38,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:03:38,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-08 10:03:38,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-08 10:03:38,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 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 10:03:38,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 86 transitions. [2025-03-08 10:03:38,801 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 86 transitions. Word has length 126 [2025-03-08 10:03:38,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:03:38,801 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 86 transitions. [2025-03-08 10:03:38,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 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 10:03:38,801 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 86 transitions. [2025-03-08 10:03:38,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 10:03:38,806 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:03:38,806 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] [2025-03-08 10:03:38,813 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 10:03:39,010 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 10:03:39,011 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:03:39,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:03:39,011 INFO L85 PathProgramCache]: Analyzing trace with hash -438648818, now seen corresponding path program 1 times [2025-03-08 10:03:39,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:03:39,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345939166] [2025-03-08 10:03:39,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:03:39,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:03:39,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 10:03:39,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 10:03:39,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:03:39,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:03:39,398 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 10:03:39,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:03:39,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345939166] [2025-03-08 10:03:39,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345939166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:03:39,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:03:39,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:03:39,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335487855] [2025-03-08 10:03:39,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:03:39,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:03:39,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:03:39,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:03:39,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:03:39,402 INFO L87 Difference]: Start difference. First operand 57 states and 86 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 10:03:39,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:03:39,487 INFO L93 Difference]: Finished difference Result 134 states and 200 transitions. [2025-03-08 10:03:39,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:03:39,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 126 [2025-03-08 10:03:39,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:03:39,490 INFO L225 Difference]: With dead ends: 134 [2025-03-08 10:03:39,491 INFO L226 Difference]: Without dead ends: 80 [2025-03-08 10:03:39,492 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 10:03:39,492 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 29 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 10:03:39,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 159 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 10:03:39,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-08 10:03:39,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2025-03-08 10:03:39,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 53 states have internal predecessors, (70), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 10:03:39,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 114 transitions. [2025-03-08 10:03:39,511 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 114 transitions. Word has length 126 [2025-03-08 10:03:39,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:03:39,512 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 114 transitions. [2025-03-08 10:03:39,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 10:03:39,514 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 114 transitions. [2025-03-08 10:03:39,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 10:03:39,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:03:39,516 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] [2025-03-08 10:03:39,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 10:03:39,516 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:03:39,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:03:39,516 INFO L85 PathProgramCache]: Analyzing trace with hash -469212393, now seen corresponding path program 1 times [2025-03-08 10:03:39,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:03:39,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503000180] [2025-03-08 10:03:39,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:03:39,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:03:39,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 10:03:39,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 10:03:39,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:03:39,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 10:03:39,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [63609810] [2025-03-08 10:03:39,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:03:39,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:03:39,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:03:39,648 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 10:03:39,648 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 10:03:39,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 10:03:39,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 10:03:39,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:03:39,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:03:39,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-08 10:03:39,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:03:40,818 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 435 proven. 114 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2025-03-08 10:03:40,818 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:03:41,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:03:41,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503000180] [2025-03-08 10:03:41,849 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 10:03:41,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63609810] [2025-03-08 10:03:41,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63609810] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:03:41,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 10:03:41,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2025-03-08 10:03:41,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646854540] [2025-03-08 10:03:41,849 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 10:03:41,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 10:03:41,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:03:41,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 10:03:41,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2025-03-08 10:03:41,852 INFO L87 Difference]: Start difference. First operand 77 states and 114 transitions. Second operand has 16 states, 16 states have (on average 3.0) internal successors, (48), 15 states have internal predecessors, (48), 5 states have call successors, (20), 5 states have call predecessors, (20), 7 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2025-03-08 10:03:42,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:03:42,662 INFO L93 Difference]: Finished difference Result 221 states and 304 transitions. [2025-03-08 10:03:42,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-08 10:03:42,664 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 15 states have internal predecessors, (48), 5 states have call successors, (20), 5 states have call predecessors, (20), 7 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) Word has length 127 [2025-03-08 10:03:42,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:03:42,668 INFO L225 Difference]: With dead ends: 221 [2025-03-08 10:03:42,668 INFO L226 Difference]: Without dead ends: 147 [2025-03-08 10:03:42,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=266, Invalid=664, Unknown=0, NotChecked=0, Total=930 [2025-03-08 10:03:42,669 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 143 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 10:03:42,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 328 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 10:03:42,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-08 10:03:42,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 98. [2025-03-08 10:03:42,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 69 states have (on average 1.2753623188405796) internal successors, (88), 70 states have internal predecessors, (88), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 10:03:42,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 132 transitions. [2025-03-08 10:03:42,690 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 132 transitions. Word has length 127 [2025-03-08 10:03:42,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:03:42,691 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 132 transitions. [2025-03-08 10:03:42,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 15 states have internal predecessors, (48), 5 states have call successors, (20), 5 states have call predecessors, (20), 7 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2025-03-08 10:03:42,692 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 132 transitions. [2025-03-08 10:03:42,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 10:03:42,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:03:42,694 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] [2025-03-08 10:03:42,703 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 10:03:42,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-08 10:03:42,894 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:03:42,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:03:42,895 INFO L85 PathProgramCache]: Analyzing trace with hash 2018300440, now seen corresponding path program 1 times [2025-03-08 10:03:42,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:03:42,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865791451] [2025-03-08 10:03:42,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:03:42,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:03:42,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 10:03:42,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 10:03:42,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:03:42,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:03:42,961 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 10:03:42,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:03:42,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865791451] [2025-03-08 10:03:42,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865791451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:03:42,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:03:42,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:03:42,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732859109] [2025-03-08 10:03:42,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:03:42,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:03:42,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:03:42,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:03:42,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:03:42,964 INFO L87 Difference]: Start difference. First operand 98 states and 132 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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 10:03:42,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:03:42,993 INFO L93 Difference]: Finished difference Result 195 states and 258 transitions. [2025-03-08 10:03:42,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:03:42,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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 127 [2025-03-08 10:03:42,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:03:42,997 INFO L225 Difference]: With dead ends: 195 [2025-03-08 10:03:42,997 INFO L226 Difference]: Without dead ends: 100 [2025-03-08 10:03:42,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:03:42,998 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 19 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:03:42,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 162 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:03:43,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-08 10:03:43,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 86. [2025-03-08 10:03:43,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 57 states have (on average 1.1578947368421053) internal successors, (66), 58 states have internal predecessors, (66), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 10:03:43,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 110 transitions. [2025-03-08 10:03:43,015 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 110 transitions. Word has length 127 [2025-03-08 10:03:43,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:03:43,016 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 110 transitions. [2025-03-08 10:03:43,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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 10:03:43,016 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 110 transitions. [2025-03-08 10:03:43,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-08 10:03:43,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:03:43,017 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] [2025-03-08 10:03:43,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 10:03:43,017 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:03:43,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:03:43,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1886749615, now seen corresponding path program 1 times [2025-03-08 10:03:43,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:03:43,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134870112] [2025-03-08 10:03:43,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:03:43,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:03:43,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 10:03:43,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 10:03:43,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:03:43,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 10:03:43,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [243515617] [2025-03-08 10:03:43,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:03:43,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:03:43,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:03:43,101 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 10:03:43,103 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 10:03:43,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 10:03:43,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 10:03:43,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:03:43,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 10:03:43,208 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 10:03:43,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 10:03:43,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 10:03:43,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:03:43,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 10:03:43,283 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 10:03:43,283 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 10:03:43,283 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 10:03:43,294 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 10:03:43,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:03:43,489 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-08 10:03:43,542 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 10:03:43,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:03:43 BoogieIcfgContainer [2025-03-08 10:03:43,546 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 10:03:43,547 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 10:03:43,547 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 10:03:43,547 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 10:03:43,548 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:03:38" (3/4) ... [2025-03-08 10:03:43,549 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 10:03:43,550 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 10:03:43,551 INFO L158 Benchmark]: Toolchain (without parser) took 6177.57ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 113.0MB in the beginning and 116.7MB in the end (delta: -3.7MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. [2025-03-08 10:03:43,552 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:03:43,552 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.49ms. Allocated memory is still 142.6MB. Free memory was 113.0MB in the beginning and 98.9MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 10:03:43,552 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.90ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 95.5MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:03:43,553 INFO L158 Benchmark]: Boogie Preprocessor took 44.54ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 89.7MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 10:03:43,553 INFO L158 Benchmark]: IcfgBuilder took 465.05ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 67.5MB in the end (delta: 22.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 10:03:43,553 INFO L158 Benchmark]: TraceAbstraction took 5386.42ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 67.0MB in the beginning and 116.7MB in the end (delta: -49.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:03:43,554 INFO L158 Benchmark]: Witness Printer took 3.09ms. Allocated memory is still 176.2MB. Free memory was 116.7MB in the beginning and 116.7MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:03:43,555 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.32ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 223.49ms. Allocated memory is still 142.6MB. Free memory was 113.0MB in the beginning and 98.9MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.90ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 95.5MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.54ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 89.7MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 465.05ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 67.5MB in the end (delta: 22.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5386.42ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 67.0MB in the beginning and 116.7MB in the end (delta: -49.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.09ms. Allocated memory is still 176.2MB. Free memory was 116.7MB in the beginning and 116.7MB in the end (delta: 33.1kB). 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 someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 116, overapproximation of someBinaryDOUBLEComparisonOperation at line 127, overapproximation of someBinaryDOUBLEComparisonOperation at line 114, overapproximation of someBinaryDOUBLEComparisonOperation at line 112. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 1; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 100; [L25] unsigned char var_1_4 = 25; [L26] unsigned short int var_1_5 = 0; [L27] unsigned short int var_1_6 = 62100; [L28] unsigned short int var_1_7 = 27651; [L29] double var_1_8 = 128.9; [L30] unsigned char var_1_9 = 1; [L31] double var_1_10 = 16.5; [L32] double var_1_11 = 25.5; [L33] double var_1_12 = 199.75; [L34] unsigned char var_1_13 = 2; [L35] unsigned char var_1_14 = 1; [L36] unsigned char var_1_15 = 1; [L37] unsigned char var_1_16 = 1; [L38] unsigned short int var_1_17 = 32; [L39] unsigned char var_1_18 = 1; [L40] unsigned long int var_1_19 = 1; VAL [isInitial=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_3=100, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L131] isInitial = 1 [L132] FCALL initially() [L133] COND TRUE 1 [L134] FCALL updateLastVariables() [L135] CALL updateVariables() [L92] var_1_2 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_3=100, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_3=100, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L93] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_3=100, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L94] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_3=100, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_3=100, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L94] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_3=100, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L95] var_1_3 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L96] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L97] CALL assume_abort_if_not(var_1_3 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L97] RET assume_abort_if_not(var_1_3 <= 255) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L98] var_1_4 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L99] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L100] CALL assume_abort_if_not(var_1_4 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L100] RET assume_abort_if_not(var_1_4 <= 255) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L101] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L101] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L102] var_1_6 = __VERIFIER_nondet_ushort() [L103] CALL assume_abort_if_not(var_1_6 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L103] RET assume_abort_if_not(var_1_6 >= 32767) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L104] CALL assume_abort_if_not(var_1_6 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L104] RET assume_abort_if_not(var_1_6 <= 65534) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L105] var_1_7 = __VERIFIER_nondet_ushort() [L106] CALL assume_abort_if_not(var_1_7 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L106] RET assume_abort_if_not(var_1_7 >= 16383) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L107] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L107] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L108] var_1_9 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10] [L109] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10] [L110] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L110] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L111] var_1_10 = __VERIFIER_nondet_double() [L112] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L112] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L113] var_1_11 = __VERIFIER_nondet_double() [L114] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L114] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L115] var_1_12 = __VERIFIER_nondet_double() [L116] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L116] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L117] var_1_14 = __VERIFIER_nondet_uchar() [L118] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=2, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=2, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L118] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_13=2, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L119] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L119] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L120] var_1_16 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L121] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L122] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L122] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L135] RET updateVariables() [L136] CALL step() [L44] COND FALSE !((var_1_3 != (16 / var_1_4)) && var_1_2) [L55] var_1_1 = var_1_3 VAL [isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L57] COND FALSE !(var_1_1 < var_1_3) VAL [isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L60] COND TRUE ! var_1_2 [L61] var_1_5 = ((((var_1_3) > ((var_1_7 + var_1_4))) ? (var_1_3) : ((var_1_7 + var_1_4)))) VAL [isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=16, var_1_5=16399, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L64] COND FALSE !(\read(var_1_2)) [L71] var_1_8 = var_1_11 VAL [isInitial=1, var_1_11=2, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=16, var_1_5=16399, var_1_6=32767, var_1_7=-49153, var_1_8=2, var_1_9=1] [L73] COND TRUE var_1_3 != ((var_1_6 / var_1_4) * ((((var_1_1) > (var_1_5)) ? (var_1_1) : (var_1_5)))) VAL [isInitial=1, var_1_11=2, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=16, var_1_5=16399, var_1_6=32767, var_1_7=-49153, var_1_8=2, var_1_9=1] [L74] COND TRUE var_1_3 <= var_1_6 [L75] var_1_13 = 32 VAL [isInitial=1, var_1_11=2, var_1_13=32, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=16, var_1_5=16399, var_1_6=32767, var_1_7=-49153, var_1_8=2, var_1_9=1] [L82] COND TRUE var_1_12 != var_1_8 [L83] var_1_15 = (! var_1_16) VAL [isInitial=1, var_1_11=2, var_1_13=32, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=16, var_1_5=16399, var_1_6=32767, var_1_7=-49153, var_1_8=2, var_1_9=1] [L87] var_1_17 = var_1_4 [L88] var_1_18 = var_1_16 [L89] var_1_19 = var_1_4 VAL [isInitial=1, var_1_11=2, var_1_13=32, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=16, var_1_18=1, var_1_19=16, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=16, var_1_5=16399, var_1_6=32767, var_1_7=-49153, var_1_8=2, var_1_9=1] [L136] RET step() [L137] CALL, EXPR property() [L127-L128] return (((((((((var_1_3 != (16 / var_1_4)) && var_1_2) ? ((var_1_3 > var_1_4) ? (var_1_1 == ((unsigned short int) (var_1_4 + var_1_3))) : (var_1_2 ? (var_1_1 == ((unsigned short int) var_1_3)) : (var_1_1 == ((unsigned short int) var_1_4)))) : (var_1_1 == ((unsigned short int) var_1_3))) && ((var_1_1 < var_1_3) ? (var_1_5 == ((unsigned short int) (var_1_6 - (var_1_7 - var_1_3)))) : ((! var_1_2) ? (var_1_5 == ((unsigned short int) ((((var_1_3) > ((var_1_7 + var_1_4))) ? (var_1_3) : ((var_1_7 + var_1_4)))))) : 1))) && (var_1_2 ? (((! var_1_9) || (var_1_5 < var_1_6)) ? (var_1_8 == ((double) ((((127.25) > (var_1_10)) ? (127.25) : (var_1_10))))) : (var_1_8 == ((double) (var_1_11 + var_1_12)))) : (var_1_8 == ((double) var_1_11)))) && ((var_1_3 != ((var_1_6 / var_1_4) * ((((var_1_1) > (var_1_5)) ? (var_1_1) : (var_1_5))))) ? ((var_1_3 <= var_1_6) ? (var_1_13 == ((unsigned char) 32)) : (var_1_13 == ((unsigned char) var_1_14))) : (var_1_13 == ((unsigned char) var_1_14)))) && ((var_1_12 != var_1_8) ? (var_1_15 == ((unsigned char) (! var_1_16))) : (var_1_15 == ((unsigned char) var_1_16)))) && (var_1_17 == ((unsigned short int) var_1_4))) && (var_1_18 == ((unsigned char) var_1_16))) && (var_1_19 == ((unsigned long int) var_1_4)) ; VAL [\result=0, isInitial=1, var_1_11=2, var_1_13=32, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=16, var_1_18=1, var_1_19=16, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=16, var_1_5=16399, var_1_6=32767, var_1_7=-49153, var_1_8=2, var_1_9=1] [L137] RET, EXPR property() [L137] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=2, var_1_13=32, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=16, var_1_18=1, var_1_19=16, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=16, var_1_5=16399, var_1_6=32767, var_1_7=-49153, var_1_8=2, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_11=2, var_1_13=32, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=16, var_1_18=1, var_1_19=16, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=16, var_1_5=16399, var_1_6=32767, var_1_7=-49153, var_1_8=2, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 60 locations, 111 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 5, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 197 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 191 mSDsluCounter, 735 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 398 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 539 IncrementalHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 337 mSDtfsCounter, 539 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 286 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=3, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 66 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1015 NumberOfCodeBlocks, 1015 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 627 ConstructedInterpolants, 0 QuantifiedInterpolants, 2142 SizeOfPredicates, 6 NumberOfNonLiveVariables, 588 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 3648/3800 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 10:03:43,571 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_codestructure_normal_file-59.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 e093e3889d1250dd6c4e72475f92fd634899e4114caa675b33a0cb0284b4d442 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:03:45,464 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:03:45,545 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 10:03:45,551 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:03:45,551 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:03:45,566 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:03:45,567 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:03:45,567 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:03:45,567 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:03:45,567 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:03:45,567 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:03:45,567 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:03:45,568 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:03:45,568 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:03:45,568 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:03:45,568 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:03:45,568 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:03:45,568 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:03:45,568 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:03:45,568 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:03:45,568 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:03:45,568 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:03:45,570 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:03:45,570 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 10:03:45,570 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 10:03:45,570 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 10:03:45,570 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:03:45,570 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:03:45,570 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:03:45,570 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:03:45,570 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:03:45,570 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:03:45,570 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:03:45,570 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:03:45,570 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:03:45,570 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:03:45,570 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:03:45,570 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:03:45,570 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:03:45,571 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 10:03:45,571 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 10:03:45,571 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:03:45,571 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:03:45,571 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:03:45,571 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:03:45,571 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 -> e093e3889d1250dd6c4e72475f92fd634899e4114caa675b33a0cb0284b4d442 [2025-03-08 10:03:45,805 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:03:45,813 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:03:45,817 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:03:45,818 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:03:45,820 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:03:45,821 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-59.i [2025-03-08 10:03:46,982 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/290a8352f/e4832be344f745fd800834065e7f8122/FLAGaffe0ad92 [2025-03-08 10:03:47,191 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:03:47,191 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-59.i [2025-03-08 10:03:47,198 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/290a8352f/e4832be344f745fd800834065e7f8122/FLAGaffe0ad92 [2025-03-08 10:03:47,214 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/290a8352f/e4832be344f745fd800834065e7f8122 [2025-03-08 10:03:47,216 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:03:47,217 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:03:47,218 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:03:47,218 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:03:47,221 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:03:47,222 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:03:47" (1/1) ... [2025-03-08 10:03:47,222 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63367c3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:47, skipping insertion in model container [2025-03-08 10:03:47,222 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:03:47" (1/1) ... [2025-03-08 10:03:47,238 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:03:47,328 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_codestructure_normal_file-59.i[913,926] [2025-03-08 10:03:47,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:03:47,382 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:03:47,390 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_codestructure_normal_file-59.i[913,926] [2025-03-08 10:03:47,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:03:47,420 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:03:47,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:47 WrapperNode [2025-03-08 10:03:47,421 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:03:47,422 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:03:47,422 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:03:47,422 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:03:47,426 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:47" (1/1) ... [2025-03-08 10:03:47,433 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:47" (1/1) ... [2025-03-08 10:03:47,450 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130 [2025-03-08 10:03:47,450 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:03:47,451 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:03:47,451 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:03:47,451 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:03:47,456 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:47" (1/1) ... [2025-03-08 10:03:47,457 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:47" (1/1) ... [2025-03-08 10:03:47,460 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:47" (1/1) ... [2025-03-08 10:03:47,468 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 10:03:47,469 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:47" (1/1) ... [2025-03-08 10:03:47,469 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:47" (1/1) ... [2025-03-08 10:03:47,477 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:47" (1/1) ... [2025-03-08 10:03:47,478 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:47" (1/1) ... [2025-03-08 10:03:47,481 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:47" (1/1) ... [2025-03-08 10:03:47,481 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:47" (1/1) ... [2025-03-08 10:03:47,484 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:03:47,484 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:03:47,484 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:03:47,484 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:03:47,485 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:47" (1/1) ... [2025-03-08 10:03:47,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:03:47,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:03:47,510 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 10:03:47,516 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 10:03:47,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:03:47,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 10:03:47,533 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:03:47,533 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:03:47,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:03:47,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:03:47,602 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:03:47,603 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:03:48,222 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 10:03:48,222 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:03:48,228 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:03:48,229 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:03:48,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:03:48 BoogieIcfgContainer [2025-03-08 10:03:48,229 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:03:48,231 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:03:48,231 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:03:48,235 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:03:48,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:03:47" (1/3) ... [2025-03-08 10:03:48,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53a4431d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:03:48, skipping insertion in model container [2025-03-08 10:03:48,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:47" (2/3) ... [2025-03-08 10:03:48,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53a4431d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:03:48, skipping insertion in model container [2025-03-08 10:03:48,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:03:48" (3/3) ... [2025-03-08 10:03:48,238 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-59.i [2025-03-08 10:03:48,248 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:03:48,250 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-59.i that has 2 procedures, 60 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:03:48,296 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:03:48,305 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;@1e519ac3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:03:48,305 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:03:48,311 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 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 10:03:48,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 10:03:48,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:03:48,321 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] [2025-03-08 10:03:48,321 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:03:48,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:03:48,327 INFO L85 PathProgramCache]: Analyzing trace with hash -325798736, now seen corresponding path program 1 times [2025-03-08 10:03:48,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:03:48,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1574516164] [2025-03-08 10:03:48,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:03:48,340 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 10:03:48,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:03:48,344 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 10:03:48,346 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 10:03:48,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 10:03:48,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 10:03:48,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:03:48,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:03:48,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:03:48,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:03:48,627 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2025-03-08 10:03:48,628 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:03:48,629 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 10:03:48,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1574516164] [2025-03-08 10:03:48,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1574516164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:03:48,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:03:48,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 10:03:48,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844897685] [2025-03-08 10:03:48,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:03:48,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:03:48,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 10:03:48,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:03:48,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:03:48,652 INFO L87 Difference]: Start difference. First operand has 60 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 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 16.5) internal successors, (33), 2 states have internal predecessors, (33), 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 10:03:48,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:03:48,668 INFO L93 Difference]: Finished difference Result 114 states and 197 transitions. [2025-03-08 10:03:48,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:03:48,670 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 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 126 [2025-03-08 10:03:48,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:03:48,675 INFO L225 Difference]: With dead ends: 114 [2025-03-08 10:03:48,676 INFO L226 Difference]: Without dead ends: 57 [2025-03-08 10:03:48,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 125 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 10:03:48,680 INFO L435 NwaCegarLoop]: 86 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, 86 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 10:03:48,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:03:48,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-08 10:03:48,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-08 10:03:48,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 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 10:03:48,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 86 transitions. [2025-03-08 10:03:48,712 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 86 transitions. Word has length 126 [2025-03-08 10:03:48,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:03:48,712 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 86 transitions. [2025-03-08 10:03:48,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 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 10:03:48,713 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 86 transitions. [2025-03-08 10:03:48,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 10:03:48,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:03:48,714 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] [2025-03-08 10:03:48,724 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 (2)] Forceful destruction successful, exit code 0 [2025-03-08 10:03:48,915 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 10:03:48,916 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:03:48,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:03:48,916 INFO L85 PathProgramCache]: Analyzing trace with hash -438648818, now seen corresponding path program 1 times [2025-03-08 10:03:48,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:03:48,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1312440733] [2025-03-08 10:03:48,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:03:48,917 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 10:03:48,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:03:48,919 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 10:03:48,920 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 10:03:48,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 10:03:49,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 10:03:49,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:03:49,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:03:49,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 10:03:49,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:03:49,184 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 10:03:49,185 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:03:49,185 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 10:03:49,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1312440733] [2025-03-08 10:03:49,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1312440733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:03:49,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:03:49,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:03:49,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42398318] [2025-03-08 10:03:49,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:03:49,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:03:49,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 10:03:49,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:03:49,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:03:49,189 INFO L87 Difference]: Start difference. First operand 57 states and 86 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 10:03:49,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:03:49,578 INFO L93 Difference]: Finished difference Result 134 states and 200 transitions. [2025-03-08 10:03:49,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:03:49,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 126 [2025-03-08 10:03:49,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:03:49,580 INFO L225 Difference]: With dead ends: 134 [2025-03-08 10:03:49,580 INFO L226 Difference]: Without dead ends: 80 [2025-03-08 10:03:49,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 124 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 10:03:49,581 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 29 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 10:03:49,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 174 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 10:03:49,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-08 10:03:49,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2025-03-08 10:03:49,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 53 states have internal predecessors, (70), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 10:03:49,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 114 transitions. [2025-03-08 10:03:49,594 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 114 transitions. Word has length 126 [2025-03-08 10:03:49,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:03:49,594 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 114 transitions. [2025-03-08 10:03:49,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 10:03:49,594 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 114 transitions. [2025-03-08 10:03:49,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 10:03:49,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:03:49,599 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] [2025-03-08 10:03:49,608 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 10:03:49,799 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 10:03:49,799 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:03:49,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:03:49,800 INFO L85 PathProgramCache]: Analyzing trace with hash -655222794, now seen corresponding path program 1 times [2025-03-08 10:03:49,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:03:49,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [897626188] [2025-03-08 10:03:49,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:03:49,801 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 10:03:49,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:03:49,803 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 10:03:49,804 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 10:03:49,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 10:03:49,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 10:03:49,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:03:49,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:03:49,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 10:03:49,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:03:50,012 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 10:03:50,016 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:03:50,017 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 10:03:50,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [897626188] [2025-03-08 10:03:50,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [897626188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:03:50,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:03:50,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:03:50,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767098970] [2025-03-08 10:03:50,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:03:50,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:03:50,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 10:03:50,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:03:50,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:03:50,018 INFO L87 Difference]: Start difference. First operand 77 states and 114 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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 10:03:50,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:03:50,393 INFO L93 Difference]: Finished difference Result 168 states and 247 transitions. [2025-03-08 10:03:50,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:03:50,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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 127 [2025-03-08 10:03:50,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:03:50,398 INFO L225 Difference]: With dead ends: 168 [2025-03-08 10:03:50,400 INFO L226 Difference]: Without dead ends: 94 [2025-03-08 10:03:50,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 125 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 10:03:50,401 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 20 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 10:03:50,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 166 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 10:03:50,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-08 10:03:50,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 80. [2025-03-08 10:03:50,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 56 states have internal predecessors, (70), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 10:03:50,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 114 transitions. [2025-03-08 10:03:50,409 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 114 transitions. Word has length 127 [2025-03-08 10:03:50,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:03:50,410 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 114 transitions. [2025-03-08 10:03:50,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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 10:03:50,410 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 114 transitions. [2025-03-08 10:03:50,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 10:03:50,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:03:50,411 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] [2025-03-08 10:03:50,420 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 10:03:50,611 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 10:03:50,612 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:03:50,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:03:50,613 INFO L85 PathProgramCache]: Analyzing trace with hash -469212393, now seen corresponding path program 1 times [2025-03-08 10:03:50,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:03:50,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1783092605] [2025-03-08 10:03:50,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:03:50,613 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 10:03:50,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:03:50,615 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 10:03:50,625 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 10:03:50,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 10:03:50,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 10:03:50,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:03:50,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:03:50,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 10:03:50,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:03:52,113 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 435 proven. 114 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2025-03-08 10:03:52,113 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:04:16,507 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 10:04:16,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1783092605] [2025-03-08 10:04:16,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1783092605] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:04:16,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [846536519] [2025-03-08 10:04:16,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:04:16,508 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 10:04:16,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 10:04:16,529 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 10:04:16,530 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 10:04:16,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 10:04:17,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 10:04:17,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:04:17,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:04:17,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-08 10:04:17,406 INFO L279 TraceCheckSpWp]: Computing forward predicates...