./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_variablewrapping_normal_file-97.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 5c538b08a3d83aa65ce7ffeb36d6290ee4fcb7724fc63e5e0592ab91abf7ec2d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:18:38,904 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:18:38,966 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:18:38,973 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:18:38,973 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:18:39,000 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:18:39,001 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:18:39,001 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:18:39,002 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:18:39,002 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:18:39,002 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:18:39,002 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:18:39,002 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:18:39,003 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:18:39,003 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:18:39,003 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:18:39,004 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:18:39,004 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:18:39,004 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:18:39,004 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:18:39,004 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:18:39,004 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:18:39,004 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:18:39,004 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:18:39,004 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:18:39,005 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:18:39,005 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:18:39,005 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:18:39,005 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:18:39,005 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:18:39,005 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:18:39,005 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:18:39,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:18:39,005 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:18:39,005 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:18:39,005 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:18:39,005 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:18:39,005 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:18:39,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:18:39,005 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:18:39,005 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:18:39,005 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:18:39,005 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:18:39,005 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 -> 5c538b08a3d83aa65ce7ffeb36d6290ee4fcb7724fc63e5e0592ab91abf7ec2d [2025-03-17 05:18:39,264 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:18:39,273 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:18:39,275 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:18:39,276 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:18:39,276 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:18:39,277 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-97.i [2025-03-17 05:18:40,495 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6da3048a9/baf8f96a570d4e1f814471a2830d0eb0/FLAG7f9ad303e [2025-03-17 05:18:40,710 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:18:40,723 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-97.i [2025-03-17 05:18:40,741 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6da3048a9/baf8f96a570d4e1f814471a2830d0eb0/FLAG7f9ad303e [2025-03-17 05:18:40,755 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6da3048a9/baf8f96a570d4e1f814471a2830d0eb0 [2025-03-17 05:18:40,756 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:18:40,757 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:18:40,758 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:18:40,758 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:18:40,761 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:18:40,761 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:18:40" (1/1) ... [2025-03-17 05:18:40,762 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75a328d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:40, skipping insertion in model container [2025-03-17 05:18:40,762 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:18:40" (1/1) ... [2025-03-17 05:18:40,772 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:18:40,862 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_variablewrapping_normal_file-97.i[913,926] [2025-03-17 05:18:40,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:18:40,902 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:18:40,910 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_variablewrapping_normal_file-97.i[913,926] [2025-03-17 05:18:40,928 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:18:40,938 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:18:40,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:40 WrapperNode [2025-03-17 05:18:40,939 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:18:40,940 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:18:40,940 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:18:40,940 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:18:40,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:40" (1/1) ... [2025-03-17 05:18:40,952 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:40" (1/1) ... [2025-03-17 05:18:40,971 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 140 [2025-03-17 05:18:40,971 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:18:40,972 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:18:40,972 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:18:40,972 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:18:40,984 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:40" (1/1) ... [2025-03-17 05:18:40,985 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:40" (1/1) ... [2025-03-17 05:18:40,986 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:40" (1/1) ... [2025-03-17 05:18:40,997 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-17 05:18:40,998 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:40" (1/1) ... [2025-03-17 05:18:40,998 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:40" (1/1) ... [2025-03-17 05:18:41,001 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:40" (1/1) ... [2025-03-17 05:18:41,002 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:40" (1/1) ... [2025-03-17 05:18:41,003 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:40" (1/1) ... [2025-03-17 05:18:41,004 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:40" (1/1) ... [2025-03-17 05:18:41,005 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:18:41,006 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:18:41,006 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:18:41,006 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:18:41,014 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:40" (1/1) ... [2025-03-17 05:18:41,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:18:41,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:18:41,044 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-17 05:18:41,048 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-17 05:18:41,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:18:41,068 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:18:41,068 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:18:41,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:18:41,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:18:41,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:18:41,127 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:18:41,128 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:18:41,321 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L100: havoc property_#t~ite15#1;havoc property_#t~bitwise14#1;havoc property_#t~short16#1; [2025-03-17 05:18:41,347 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-03-17 05:18:41,348 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:18:41,359 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:18:41,359 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:18:41,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:18:41 BoogieIcfgContainer [2025-03-17 05:18:41,360 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:18:41,362 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:18:41,362 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:18:41,366 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:18:41,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:18:40" (1/3) ... [2025-03-17 05:18:41,367 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1acfd61d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:18:41, skipping insertion in model container [2025-03-17 05:18:41,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:40" (2/3) ... [2025-03-17 05:18:41,368 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1acfd61d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:18:41, skipping insertion in model container [2025-03-17 05:18:41,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:18:41" (3/3) ... [2025-03-17 05:18:41,369 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-97.i [2025-03-17 05:18:41,384 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:18:41,386 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-97.i that has 2 procedures, 58 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:18:41,450 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:18:41,462 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;@767921, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:18:41,463 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:18:41,468 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 39 states have internal predecessors, (55), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:18:41,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 05:18:41,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:18:41,479 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:18:41,479 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:18:41,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:18:41,486 INFO L85 PathProgramCache]: Analyzing trace with hash -989331504, now seen corresponding path program 1 times [2025-03-17 05:18:41,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:18:41,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326331612] [2025-03-17 05:18:41,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:18:41,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:18:41,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 05:18:41,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 05:18:41,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:18:41,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:18:41,723 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-17 05:18:41,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:18:41,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326331612] [2025-03-17 05:18:41,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326331612] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:18:41,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134192951] [2025-03-17 05:18:41,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:18:41,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:18:41,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:18:41,728 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-17 05:18:41,731 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-17 05:18:41,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 05:18:41,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 05:18:41,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:18:41,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:18:41,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:18:41,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:18:41,861 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-17 05:18:41,861 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:18:41,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134192951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:18:41,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:18:41,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:18:41,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939550089] [2025-03-17 05:18:41,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:18:41,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:18:41,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:18:41,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:18:41,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:18:41,881 INFO L87 Difference]: Start difference. First operand has 58 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 39 states have internal predecessors, (55), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:18:41,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:18:41,906 INFO L93 Difference]: Finished difference Result 113 states and 193 transitions. [2025-03-17 05:18:41,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:18:41,909 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 105 [2025-03-17 05:18:41,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:18:41,915 INFO L225 Difference]: With dead ends: 113 [2025-03-17 05:18:41,915 INFO L226 Difference]: Without dead ends: 56 [2025-03-17 05:18:41,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 106 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-17 05:18:41,922 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:18:41,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:18:41,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-17 05:18:41,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-17 05:18:41,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 37 states have internal predecessors, (51), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:18:41,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 85 transitions. [2025-03-17 05:18:41,972 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 85 transitions. Word has length 105 [2025-03-17 05:18:41,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:18:41,972 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 85 transitions. [2025-03-17 05:18:41,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:18:41,973 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 85 transitions. [2025-03-17 05:18:41,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 05:18:41,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:18:41,975 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:18:41,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 05:18:42,175 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-17 05:18:42,176 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:18:42,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:18:42,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1497527889, now seen corresponding path program 1 times [2025-03-17 05:18:42,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:18:42,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931676439] [2025-03-17 05:18:42,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:18:42,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:18:42,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 05:18:42,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 05:18:42,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:18:42,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:18:42,610 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:18:42,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:18:42,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931676439] [2025-03-17 05:18:42,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931676439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:18:42,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:18:42,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:18:42,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366466082] [2025-03-17 05:18:42,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:18:42,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:18:42,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:18:42,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:18:42,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:18:42,613 INFO L87 Difference]: Start difference. First operand 56 states and 85 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:18:42,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:18:42,741 INFO L93 Difference]: Finished difference Result 158 states and 238 transitions. [2025-03-17 05:18:42,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:18:42,742 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 105 [2025-03-17 05:18:42,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:18:42,744 INFO L225 Difference]: With dead ends: 158 [2025-03-17 05:18:42,744 INFO L226 Difference]: Without dead ends: 103 [2025-03-17 05:18:42,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:18:42,748 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 64 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:18:42,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 460 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:18:42,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-17 05:18:42,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 59. [2025-03-17 05:18:42,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:18:42,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 88 transitions. [2025-03-17 05:18:42,762 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 88 transitions. Word has length 105 [2025-03-17 05:18:42,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:18:42,763 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 88 transitions. [2025-03-17 05:18:42,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:18:42,764 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 88 transitions. [2025-03-17 05:18:42,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-17 05:18:42,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:18:42,767 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:18:42,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:18:42,768 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:18:42,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:18:42,769 INFO L85 PathProgramCache]: Analyzing trace with hash 138227743, now seen corresponding path program 1 times [2025-03-17 05:18:42,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:18:42,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626530937] [2025-03-17 05:18:42,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:18:42,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:18:42,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-17 05:18:42,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-17 05:18:42,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:18:42,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:18:43,839 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:18:43,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:18:43,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626530937] [2025-03-17 05:18:43,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626530937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:18:43,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:18:43,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:18:43,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105886697] [2025-03-17 05:18:43,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:18:43,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:18:43,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:18:43,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:18:43,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:18:43,844 INFO L87 Difference]: Start difference. First operand 59 states and 88 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:18:44,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:18:44,155 INFO L93 Difference]: Finished difference Result 177 states and 260 transitions. [2025-03-17 05:18:44,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:18:44,156 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 106 [2025-03-17 05:18:44,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:18:44,157 INFO L225 Difference]: With dead ends: 177 [2025-03-17 05:18:44,157 INFO L226 Difference]: Without dead ends: 119 [2025-03-17 05:18:44,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:18:44,158 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 96 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:18:44,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 242 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:18:44,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-17 05:18:44,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 60. [2025-03-17 05:18:44,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 41 states have internal predecessors, (54), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:18:44,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 88 transitions. [2025-03-17 05:18:44,165 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 88 transitions. Word has length 106 [2025-03-17 05:18:44,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:18:44,166 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 88 transitions. [2025-03-17 05:18:44,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:18:44,166 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 88 transitions. [2025-03-17 05:18:44,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-17 05:18:44,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:18:44,167 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:18:44,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 05:18:44,168 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:18:44,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:18:44,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1634757811, now seen corresponding path program 1 times [2025-03-17 05:18:44,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:18:44,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833253570] [2025-03-17 05:18:44,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:18:44,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:18:44,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 05:18:44,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 05:18:44,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:18:44,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:18:44,476 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:18:44,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:18:44,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833253570] [2025-03-17 05:18:44,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833253570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:18:44,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:18:44,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:18:44,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146258668] [2025-03-17 05:18:44,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:18:44,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:18:44,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:18:44,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:18:44,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:18:44,479 INFO L87 Difference]: Start difference. First operand 60 states and 88 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:18:44,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:18:44,770 INFO L93 Difference]: Finished difference Result 208 states and 303 transitions. [2025-03-17 05:18:44,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:18:44,771 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 107 [2025-03-17 05:18:44,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:18:44,773 INFO L225 Difference]: With dead ends: 208 [2025-03-17 05:18:44,773 INFO L226 Difference]: Without dead ends: 149 [2025-03-17 05:18:44,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:18:44,774 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 145 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:18:44,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 513 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:18:44,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-03-17 05:18:44,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 58. [2025-03-17 05:18:44,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:18:44,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 85 transitions. [2025-03-17 05:18:44,791 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 85 transitions. Word has length 107 [2025-03-17 05:18:44,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:18:44,792 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 85 transitions. [2025-03-17 05:18:44,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:18:44,793 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 85 transitions. [2025-03-17 05:18:44,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-17 05:18:44,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:18:44,796 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:18:44,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:18:44,796 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:18:44,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:18:44,796 INFO L85 PathProgramCache]: Analyzing trace with hash -516142161, now seen corresponding path program 1 times [2025-03-17 05:18:44,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:18:44,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862199838] [2025-03-17 05:18:44,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:18:44,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:18:44,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 05:18:44,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 05:18:44,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:18:44,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:18:45,167 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 63 proven. 27 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2025-03-17 05:18:45,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:18:45,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862199838] [2025-03-17 05:18:45,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862199838] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:18:45,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370849803] [2025-03-17 05:18:45,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:18:45,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:18:45,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:18:45,174 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-17 05:18:45,175 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-17 05:18:45,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 05:18:45,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 05:18:45,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:18:45,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:18:45,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 05:18:45,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:18:45,502 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 302 proven. 27 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2025-03-17 05:18:45,503 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:18:45,775 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 63 proven. 30 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2025-03-17 05:18:45,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370849803] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:18:45,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:18:45,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2025-03-17 05:18:45,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763986222] [2025-03-17 05:18:45,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:18:45,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 05:18:45,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:18:45,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 05:18:45,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:18:45,777 INFO L87 Difference]: Start difference. First operand 58 states and 85 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 3 states have call successors, (23), 3 states have call predecessors, (23), 7 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2025-03-17 05:18:46,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:18:46,189 INFO L93 Difference]: Finished difference Result 145 states and 209 transitions. [2025-03-17 05:18:46,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 05:18:46,189 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 3 states have call successors, (23), 3 states have call predecessors, (23), 7 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 107 [2025-03-17 05:18:46,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:18:46,191 INFO L225 Difference]: With dead ends: 145 [2025-03-17 05:18:46,191 INFO L226 Difference]: Without dead ends: 88 [2025-03-17 05:18:46,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 208 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=205, Invalid=445, Unknown=0, NotChecked=0, Total=650 [2025-03-17 05:18:46,192 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 73 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:18:46,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 218 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:18:46,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-17 05:18:46,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 79. [2025-03-17 05:18:46,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 49 states have internal predecessors, (58), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-17 05:18:46,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 112 transitions. [2025-03-17 05:18:46,211 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 112 transitions. Word has length 107 [2025-03-17 05:18:46,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:18:46,211 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 112 transitions. [2025-03-17 05:18:46,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 3 states have call successors, (23), 3 states have call predecessors, (23), 7 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2025-03-17 05:18:46,212 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 112 transitions. [2025-03-17 05:18:46,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-17 05:18:46,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:18:46,213 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:18:46,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 05:18:46,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:18:46,413 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:18:46,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:18:46,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1133524483, now seen corresponding path program 1 times [2025-03-17 05:18:46,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:18:46,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553661428] [2025-03-17 05:18:46,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:18:46,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:18:46,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 05:18:46,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 05:18:46,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:18:46,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:18:46,467 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 05:18:46,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 05:18:46,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 05:18:46,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:18:46,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:18:46,532 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 05:18:46,532 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 05:18:46,534 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:18:46,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 05:18:46,539 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-17 05:18:46,597 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 05:18:46,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:18:46 BoogieIcfgContainer [2025-03-17 05:18:46,602 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 05:18:46,602 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 05:18:46,603 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 05:18:46,603 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 05:18:46,603 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:18:41" (3/4) ... [2025-03-17 05:18:46,605 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 05:18:46,605 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 05:18:46,606 INFO L158 Benchmark]: Toolchain (without parser) took 5848.70ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 104.5MB in the beginning and 201.1MB in the end (delta: -96.6MB). Peak memory consumption was 93.8MB. Max. memory is 16.1GB. [2025-03-17 05:18:46,607 INFO L158 Benchmark]: CDTParser took 1.08ms. Allocated memory is still 201.3MB. Free memory is still 128.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:18:46,607 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.36ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 91.6MB in the end (delta: 12.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 05:18:46,607 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.49ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 89.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:18:46,608 INFO L158 Benchmark]: Boogie Preprocessor took 33.33ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 87.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:18:46,608 INFO L158 Benchmark]: IcfgBuilder took 354.35ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 70.1MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 05:18:46,608 INFO L158 Benchmark]: TraceAbstraction took 5239.88ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 69.1MB in the beginning and 201.2MB in the end (delta: -132.1MB). Peak memory consumption was 60.3MB. Max. memory is 16.1GB. [2025-03-17 05:18:46,608 INFO L158 Benchmark]: Witness Printer took 2.92ms. Allocated memory is still 335.5MB. Free memory was 201.2MB in the beginning and 201.1MB in the end (delta: 106.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:18:46,609 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.08ms. Allocated memory is still 201.3MB. Free memory is still 128.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 181.36ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 91.6MB in the end (delta: 12.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.49ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 89.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.33ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 87.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 354.35ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 70.1MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5239.88ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 69.1MB in the beginning and 201.2MB in the end (delta: -132.1MB). Peak memory consumption was 60.3MB. Max. memory is 16.1GB. * Witness Printer took 2.92ms. Allocated memory is still 335.5MB. Free memory was 201.2MB in the beginning and 201.1MB in the end (delta: 106.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 95, overapproximation of someBinaryFLOATComparisonOperation at line 100, overapproximation of someBinaryFLOATComparisonOperation at line 43. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] signed short int var_1_7 = 32; [L24] signed short int var_1_8 = 20113; [L25] signed short int var_1_9 = 100; [L26] signed char var_1_10 = 100; [L27] signed char var_1_11 = -1; [L28] signed char var_1_12 = 16; [L29] unsigned char var_1_13 = 1; [L30] unsigned char var_1_15 = 0; [L31] unsigned char var_1_16 = 1; [L32] unsigned short int var_1_18 = 10; [L33] unsigned short int var_1_19 = 256; [L34] float var_1_20 = 32.5; [L35] float var_1_21 = 127.4; [L36] signed short int var_1_22 = 128; [L104] isInitial = 1 [L105] FCALL initially() [L106] COND TRUE 1 [L107] FCALL updateLastVariables() [L108] CALL updateVariables() [L70] var_1_7 = __VERIFIER_nondet_short() [L71] CALL assume_abort_if_not(var_1_7 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=20113, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=20113, var_1_9=100] [L71] RET assume_abort_if_not(var_1_7 >= -1) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=20113, var_1_9=100] [L72] CALL assume_abort_if_not(var_1_7 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=20113, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=20113, var_1_9=100] [L72] RET assume_abort_if_not(var_1_7 <= 32766) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=20113, var_1_9=100] [L73] var_1_8 = __VERIFIER_nondet_short() [L74] CALL assume_abort_if_not(var_1_8 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=100] [L74] RET assume_abort_if_not(var_1_8 >= 16383) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=100] [L75] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=100] [L75] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=100] [L76] var_1_9 = __VERIFIER_nondet_short() [L77] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L77] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L78] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L78] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L79] var_1_11 = __VERIFIER_nondet_char() [L80] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=25, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=25, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L80] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, var_1_10=100, var_1_11=25, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L81] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=25, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=25, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L81] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, var_1_10=100, var_1_11=25, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L82] var_1_12 = __VERIFIER_nondet_char() [L83] CALL assume_abort_if_not(var_1_12 >= -31) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=25, var_1_12=4, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=25, var_1_12=4, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L83] RET assume_abort_if_not(var_1_12 >= -31) VAL [isInitial=1, var_1_10=100, var_1_11=25, var_1_12=4, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L84] CALL assume_abort_if_not(var_1_12 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=25, var_1_12=4, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=25, var_1_12=4, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L84] RET assume_abort_if_not(var_1_12 <= 32) VAL [isInitial=1, var_1_10=100, var_1_11=25, var_1_12=4, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L85] var_1_15 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=25, var_1_12=4, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=25, var_1_12=4, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L86] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10=100, var_1_11=25, var_1_12=4, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L87] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=25, var_1_12=4, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=25, var_1_12=4, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L87] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=100, var_1_11=25, var_1_12=4, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L88] var_1_16 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=25, var_1_12=4, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=25, var_1_12=4, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L89] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_10=100, var_1_11=25, var_1_12=4, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L90] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=25, var_1_12=4, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=25, var_1_12=4, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L90] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_10=100, var_1_11=25, var_1_12=4, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L91] var_1_19 = __VERIFIER_nondet_ushort() [L92] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=25, var_1_12=4, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=25, var_1_12=4, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L92] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=100, var_1_11=25, var_1_12=4, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L93] CALL assume_abort_if_not(var_1_19 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=25, var_1_12=4, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=32765, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=25, var_1_12=4, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=32765, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L93] RET assume_abort_if_not(var_1_19 <= 65534) VAL [isInitial=1, var_1_10=100, var_1_11=25, var_1_12=4, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=32765, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L94] var_1_21 = __VERIFIER_nondet_float() [L95] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=25, var_1_12=4, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=32765, var_1_1=16, var_1_20=65/2, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=25, var_1_12=4, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=32765, var_1_1=16, var_1_20=65/2, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L95] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=100, var_1_11=25, var_1_12=4, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=32765, var_1_1=16, var_1_20=65/2, var_1_22=128, var_1_7=32765, var_1_8=32766, var_1_9=0] [L108] RET updateVariables() [L109] CALL step() [L40] var_1_18 = var_1_19 [L41] var_1_20 = var_1_21 [L42] var_1_22 = var_1_12 VAL [isInitial=1, var_1_10=100, var_1_11=25, var_1_12=4, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=32765, var_1_19=32765, var_1_1=16, var_1_20=32771, var_1_21=32771, var_1_22=4, var_1_7=32765, var_1_8=32766, var_1_9=0] [L43] COND TRUE 127.5f > var_1_20 [L44] var_1_13 = (var_1_15 && var_1_16) VAL [isInitial=1, var_1_10=100, var_1_11=25, var_1_12=4, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=32765, var_1_19=32765, var_1_1=16, var_1_20=32771, var_1_21=32771, var_1_22=4, var_1_7=32765, var_1_8=32766, var_1_9=0] [L48] COND TRUE var_1_18 == var_1_7 [L49] var_1_10 = (var_1_11 + (var_1_12 + -25)) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=4, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=32765, var_1_19=32765, var_1_1=16, var_1_20=32771, var_1_21=32771, var_1_22=4, var_1_7=32765, var_1_8=32766, var_1_9=0] [L57] COND TRUE \read(var_1_13) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=4, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=32765, var_1_19=32765, var_1_1=16, var_1_20=32771, var_1_21=32771, var_1_22=4, var_1_7=32765, var_1_8=32766, var_1_9=0] [L58] COND FALSE !(var_1_10 > var_1_22) [L65] var_1_1 = 8 VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=4, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=32765, var_1_19=32765, var_1_1=8, var_1_20=32771, var_1_21=32771, var_1_22=4, var_1_7=32765, var_1_8=32766, var_1_9=0] [L109] RET step() [L110] CALL, EXPR property() [L100] EXPR (var_1_13 ? ((var_1_10 > var_1_22) ? (var_1_13 ? (var_1_1 == ((signed short int) (var_1_7 - (var_1_8 - var_1_9)))) : (var_1_1 == ((signed short int) var_1_18))) : (var_1_1 == ((signed short int) 8))) : 1) && ((var_1_18 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : ((((32 * -25) | var_1_22) >= var_1_11) ? (var_1_13 ? (var_1_10 == ((signed char) var_1_12)) : 1) : 1)) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=4, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=32765, var_1_19=32765, var_1_1=8, var_1_20=32771, var_1_21=32771, var_1_22=4, var_1_7=32765, var_1_8=32766, var_1_9=0] [L100] EXPR (var_1_18 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : ((((32 * -25) | var_1_22) >= var_1_11) ? (var_1_13 ? (var_1_10 == ((signed char) var_1_12)) : 1) : 1) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=4, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=32765, var_1_19=32765, var_1_1=8, var_1_20=32771, var_1_21=32771, var_1_22=4, var_1_7=32765, var_1_8=32766, var_1_9=0] [L100] EXPR (var_1_13 ? ((var_1_10 > var_1_22) ? (var_1_13 ? (var_1_1 == ((signed short int) (var_1_7 - (var_1_8 - var_1_9)))) : (var_1_1 == ((signed short int) var_1_18))) : (var_1_1 == ((signed short int) 8))) : 1) && ((var_1_18 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : ((((32 * -25) | var_1_22) >= var_1_11) ? (var_1_13 ? (var_1_10 == ((signed char) var_1_12)) : 1) : 1)) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=4, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=32765, var_1_19=32765, var_1_1=8, var_1_20=32771, var_1_21=32771, var_1_22=4, var_1_7=32765, var_1_8=32766, var_1_9=0] [L100-L101] return (((((var_1_13 ? ((var_1_10 > var_1_22) ? (var_1_13 ? (var_1_1 == ((signed short int) (var_1_7 - (var_1_8 - var_1_9)))) : (var_1_1 == ((signed short int) var_1_18))) : (var_1_1 == ((signed short int) 8))) : 1) && ((var_1_18 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : ((((32 * -25) | var_1_22) >= var_1_11) ? (var_1_13 ? (var_1_10 == ((signed char) var_1_12)) : 1) : 1))) && ((127.5f > var_1_20) ? (var_1_13 == ((unsigned char) (var_1_15 && var_1_16))) : (var_1_13 == ((unsigned char) ((var_1_20 >= var_1_20) || var_1_15))))) && (var_1_18 == ((unsigned short int) var_1_19))) && (var_1_20 == ((float) var_1_21))) && (var_1_22 == ((signed short int) var_1_12)) ; [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=4, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=32765, var_1_19=32765, var_1_1=8, var_1_20=32771, var_1_21=32771, var_1_22=4, var_1_7=32765, var_1_8=32766, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=4, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=32765, var_1_19=32765, var_1_1=8, var_1_20=32771, var_1_21=32771, var_1_22=4, var_1_7=32765, var_1_8=32766, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 58 locations, 106 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 6, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 393 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 378 mSDsluCounter, 1516 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 993 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 749 IncrementalHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 523 mSDtfsCounter, 749 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 364 GetRequests, 322 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=5, 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, 5 MinimizatonAttempts, 203 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 850 NumberOfCodeBlocks, 850 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 841 ConstructedInterpolants, 0 QuantifiedInterpolants, 1620 SizeOfPredicates, 3 NumberOfNonLiveVariables, 505 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 4236/4352 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-17 05:18:46,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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_variablewrapping_normal_file-97.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 5c538b08a3d83aa65ce7ffeb36d6290ee4fcb7724fc63e5e0592ab91abf7ec2d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:18:48,563 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:18:48,649 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 05:18:48,653 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:18:48,656 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:18:48,680 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:18:48,681 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:18:48,681 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:18:48,682 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:18:48,682 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:18:48,683 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:18:48,683 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:18:48,683 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:18:48,683 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:18:48,683 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:18:48,684 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:18:48,684 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:18:48,684 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:18:48,684 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:18:48,684 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:18:48,684 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:18:48,684 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:18:48,685 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:18:48,685 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 05:18:48,685 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 05:18:48,685 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 05:18:48,685 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:18:48,685 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:18:48,685 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:18:48,685 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:18:48,685 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:18:48,686 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:18:48,686 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:18:48,686 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:18:48,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:18:48,686 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:18:48,686 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:18:48,686 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:18:48,686 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:18:48,686 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 05:18:48,687 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 05:18:48,687 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:18:48,687 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:18:48,687 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:18:48,687 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:18:48,687 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/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 -> 5c538b08a3d83aa65ce7ffeb36d6290ee4fcb7724fc63e5e0592ab91abf7ec2d [2025-03-17 05:18:48,954 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:18:48,960 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:18:48,963 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:18:48,964 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:18:48,964 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:18:48,965 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-97.i [2025-03-17 05:18:50,171 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/188c9724b/2b0f509503f5438eb6e4e2b85b95ac47/FLAG1d3b22803 [2025-03-17 05:18:50,372 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:18:50,373 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-97.i [2025-03-17 05:18:50,380 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/188c9724b/2b0f509503f5438eb6e4e2b85b95ac47/FLAG1d3b22803 [2025-03-17 05:18:50,398 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/188c9724b/2b0f509503f5438eb6e4e2b85b95ac47 [2025-03-17 05:18:50,400 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:18:50,402 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:18:50,404 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:18:50,404 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:18:50,407 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:18:50,408 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:18:50" (1/1) ... [2025-03-17 05:18:50,410 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1625d3e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:50, skipping insertion in model container [2025-03-17 05:18:50,410 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:18:50" (1/1) ... [2025-03-17 05:18:50,427 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:18:50,552 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_variablewrapping_normal_file-97.i[913,926] [2025-03-17 05:18:50,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:18:50,614 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:18:50,624 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_variablewrapping_normal_file-97.i[913,926] [2025-03-17 05:18:50,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:18:50,665 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:18:50,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:50 WrapperNode [2025-03-17 05:18:50,667 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:18:50,668 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:18:50,668 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:18:50,669 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:18:50,674 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:50" (1/1) ... [2025-03-17 05:18:50,686 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:50" (1/1) ... [2025-03-17 05:18:50,710 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2025-03-17 05:18:50,711 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:18:50,711 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:18:50,711 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:18:50,711 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:18:50,719 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:50" (1/1) ... [2025-03-17 05:18:50,721 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:50" (1/1) ... [2025-03-17 05:18:50,725 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:50" (1/1) ... [2025-03-17 05:18:50,738 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-17 05:18:50,742 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:50" (1/1) ... [2025-03-17 05:18:50,742 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:50" (1/1) ... [2025-03-17 05:18:50,749 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:50" (1/1) ... [2025-03-17 05:18:50,750 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:50" (1/1) ... [2025-03-17 05:18:50,756 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:50" (1/1) ... [2025-03-17 05:18:50,756 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:50" (1/1) ... [2025-03-17 05:18:50,762 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:18:50,763 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:18:50,766 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:18:50,767 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:18:50,768 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:50" (1/1) ... [2025-03-17 05:18:50,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:18:50,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:18:50,796 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-17 05:18:50,800 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-17 05:18:50,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:18:50,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 05:18:50,821 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:18:50,821 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:18:50,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:18:50,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:18:50,888 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:18:50,890 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:18:51,071 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-17 05:18:51,071 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:18:51,078 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:18:51,078 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:18:51,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:18:51 BoogieIcfgContainer [2025-03-17 05:18:51,079 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:18:51,081 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:18:51,081 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:18:51,085 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:18:51,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:18:50" (1/3) ... [2025-03-17 05:18:51,085 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b3e5de7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:18:51, skipping insertion in model container [2025-03-17 05:18:51,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:50" (2/3) ... [2025-03-17 05:18:51,085 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b3e5de7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:18:51, skipping insertion in model container [2025-03-17 05:18:51,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:18:51" (3/3) ... [2025-03-17 05:18:51,086 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-97.i [2025-03-17 05:18:51,097 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:18:51,099 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-97.i that has 2 procedures, 46 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:18:51,144 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:18:51,152 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;@44f3745f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:18:51,153 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:18:51,157 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 27 states have internal predecessors, (37), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:18:51,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-17 05:18:51,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:18:51,166 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:18:51,166 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:18:51,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:18:51,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1793776314, now seen corresponding path program 1 times [2025-03-17 05:18:51,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:18:51,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1549573226] [2025-03-17 05:18:51,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:18:51,178 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-17 05:18:51,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:18:51,180 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-17 05:18:51,182 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-17 05:18:51,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 05:18:51,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 05:18:51,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:18:51,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:18:51,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:18:51,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:18:51,364 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2025-03-17 05:18:51,364 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:18:51,365 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:18:51,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1549573226] [2025-03-17 05:18:51,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1549573226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:18:51,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:18:51,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 05:18:51,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701818465] [2025-03-17 05:18:51,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:18:51,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:18:51,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:18:51,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:18:51,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:18:51,391 INFO L87 Difference]: Start difference. First operand has 46 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 27 states have internal predecessors, (37), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:18:51,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:18:51,410 INFO L93 Difference]: Finished difference Result 89 states and 157 transitions. [2025-03-17 05:18:51,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:18:51,413 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 102 [2025-03-17 05:18:51,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:18:51,417 INFO L225 Difference]: With dead ends: 89 [2025-03-17 05:18:51,417 INFO L226 Difference]: Without dead ends: 44 [2025-03-17 05:18:51,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 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-17 05:18:51,421 INFO L435 NwaCegarLoop]: 67 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, 67 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-17 05:18:51,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:18:51,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-17 05:18:51,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-17 05:18:51,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:18:51,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 67 transitions. [2025-03-17 05:18:51,469 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 67 transitions. Word has length 102 [2025-03-17 05:18:51,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:18:51,469 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 67 transitions. [2025-03-17 05:18:51,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:18:51,470 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 67 transitions. [2025-03-17 05:18:51,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-17 05:18:51,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:18:51,472 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:18:51,477 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-17 05:18:51,674 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-17 05:18:51,674 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:18:51,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:18:51,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1549608549, now seen corresponding path program 1 times [2025-03-17 05:18:51,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:18:51,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [525084444] [2025-03-17 05:18:51,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:18:51,675 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-17 05:18:51,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:18:51,679 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-17 05:18:51,680 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-17 05:18:51,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 05:18:51,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 05:18:51,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:18:51,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:18:51,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:18:51,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:18:52,081 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 302 proven. 27 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2025-03-17 05:18:52,082 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:18:52,347 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 63 proven. 30 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2025-03-17 05:18:52,349 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:18:52,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [525084444] [2025-03-17 05:18:52,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [525084444] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:18:52,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:18:52,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2025-03-17 05:18:52,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127766615] [2025-03-17 05:18:52,350 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:18:52,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 05:18:52,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:18:52,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 05:18:52,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:18:52,353 INFO L87 Difference]: Start difference. First operand 44 states and 67 transitions. Second operand has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 3 states have call successors, (23), 3 states have call predecessors, (23), 7 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-03-17 05:18:52,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:18:52,835 INFO L93 Difference]: Finished difference Result 118 states and 174 transitions. [2025-03-17 05:18:52,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 05:18:52,836 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 3 states have call successors, (23), 3 states have call predecessors, (23), 7 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 102 [2025-03-17 05:18:52,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:18:52,837 INFO L225 Difference]: With dead ends: 118 [2025-03-17 05:18:52,837 INFO L226 Difference]: Without dead ends: 75 [2025-03-17 05:18:52,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=205, Invalid=445, Unknown=0, NotChecked=0, Total=650 [2025-03-17 05:18:52,838 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 77 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:18:52,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 147 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:18:52,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-17 05:18:52,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 67. [2025-03-17 05:18:52,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 37 states have internal predecessors, (41), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-17 05:18:52,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 95 transitions. [2025-03-17 05:18:52,855 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 95 transitions. Word has length 102 [2025-03-17 05:18:52,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:18:52,855 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 95 transitions. [2025-03-17 05:18:52,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 3 states have call successors, (23), 3 states have call predecessors, (23), 7 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-03-17 05:18:52,855 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 95 transitions. [2025-03-17 05:18:52,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-17 05:18:52,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:18:52,856 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:18:52,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-17 05:18:53,060 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-17 05:18:53,060 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:18:53,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:18:53,061 INFO L85 PathProgramCache]: Analyzing trace with hash 792392571, now seen corresponding path program 1 times [2025-03-17 05:18:53,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:18:53,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1383326124] [2025-03-17 05:18:53,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:18:53,061 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-17 05:18:53,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:18:53,063 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-17 05:18:53,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 05:18:53,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-17 05:18:53,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-17 05:18:53,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:18:53,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:18:53,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 05:18:53,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:19:55,129 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-17 05:19:55,129 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:19:55,129 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:19:55,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1383326124] [2025-03-17 05:19:55,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1383326124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:19:55,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:19:55,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:19:55,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437538233] [2025-03-17 05:19:55,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:19:55,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:19:55,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:19:55,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:19:55,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:19:55,131 INFO L87 Difference]: Start difference. First operand 67 states and 95 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:19:56,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:19:56,180 INFO L93 Difference]: Finished difference Result 120 states and 157 transitions. [2025-03-17 05:19:56,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 05:19:56,181 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 103 [2025-03-17 05:19:56,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:19:56,183 INFO L225 Difference]: With dead ends: 120 [2025-03-17 05:19:56,183 INFO L226 Difference]: Without dead ends: 118 [2025-03-17 05:19:56,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2025-03-17 05:19:56,184 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 126 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 05:19:56,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 190 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 05:19:56,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-17 05:19:56,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 80. [2025-03-17 05:19:56,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 47 states have (on average 1.148936170212766) internal successors, (54), 48 states have internal predecessors, (54), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-17 05:19:56,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 108 transitions. [2025-03-17 05:19:56,196 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 108 transitions. Word has length 103 [2025-03-17 05:19:56,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:19:56,197 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 108 transitions. [2025-03-17 05:19:56,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:19:56,197 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 108 transitions. [2025-03-17 05:19:56,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-17 05:19:56,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:19:56,201 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:19:56,206 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-17 05:19:56,402 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-17 05:19:56,402 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:19:56,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:19:56,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1679896252, now seen corresponding path program 1 times [2025-03-17 05:19:56,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:19:56,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1396408200] [2025-03-17 05:19:56,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:19:56,403 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-17 05:19:56,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:19:56,410 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-17 05:19:56,411 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-17 05:19:56,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-17 05:19:56,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-17 05:19:56,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:19:56,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:19:56,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 05:19:56,499 INFO L279 TraceCheckSpWp]: Computing forward predicates...