./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-66.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 3528376fb447b7e4334860ab48f714a16089e5384cb298e6197e1f3cf82dfcc6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:40:18,066 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:40:18,112 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 18:40:18,115 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:40:18,115 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:40:18,129 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:40:18,129 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:40:18,129 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:40:18,130 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:40:18,130 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:40:18,131 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:40:18,131 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:40:18,131 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:40:18,131 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:40:18,131 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:40:18,132 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:40:18,132 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:40:18,132 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 18:40:18,132 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 18:40:18,132 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 18:40:18,132 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:40:18,132 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:40:18,132 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:40:18,132 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:40:18,132 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 18:40:18,133 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:40:18,133 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:40:18,133 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:40:18,133 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:40:18,133 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:40:18,133 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:40:18,133 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:40:18,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:40:18,134 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:40:18,134 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:40:18,134 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:40:18,134 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:40:18,134 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 18:40:18,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 18:40:18,134 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:40:18,134 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:40:18,134 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:40:18,134 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:40:18,134 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 -> 3528376fb447b7e4334860ab48f714a16089e5384cb298e6197e1f3cf82dfcc6 [2025-03-03 18:40:18,367 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:40:18,372 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:40:18,375 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:40:18,376 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:40:18,376 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:40:18,377 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-66.i [2025-03-03 18:40:19,455 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/add6841de/366b50cd081144858525b5da52e41cf9/FLAG5078b5885 [2025-03-03 18:40:19,678 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:40:19,682 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-66.i [2025-03-03 18:40:19,706 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/add6841de/366b50cd081144858525b5da52e41cf9/FLAG5078b5885 [2025-03-03 18:40:20,024 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/add6841de/366b50cd081144858525b5da52e41cf9 [2025-03-03 18:40:20,026 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:40:20,027 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:40:20,028 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:40:20,028 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:40:20,031 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:40:20,031 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:40:20" (1/1) ... [2025-03-03 18:40:20,032 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@350ce49a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:40:20, skipping insertion in model container [2025-03-03 18:40:20,032 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:40:20" (1/1) ... [2025-03-03 18:40:20,042 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:40:20,136 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-66.i[919,932] [2025-03-03 18:40:20,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:40:20,196 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:40:20,204 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-66.i[919,932] [2025-03-03 18:40:20,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:40:20,244 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:40:20,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:40:20 WrapperNode [2025-03-03 18:40:20,246 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:40:20,246 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:40:20,246 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:40:20,247 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:40:20,251 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:40:20" (1/1) ... [2025-03-03 18:40:20,260 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:40:20" (1/1) ... [2025-03-03 18:40:20,285 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 124 [2025-03-03 18:40:20,285 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:40:20,286 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:40:20,286 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:40:20,286 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:40:20,292 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:40:20" (1/1) ... [2025-03-03 18:40:20,293 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:40:20" (1/1) ... [2025-03-03 18:40:20,296 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:40:20" (1/1) ... [2025-03-03 18:40:20,316 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 18:40:20,317 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:40:20" (1/1) ... [2025-03-03 18:40:20,317 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:40:20" (1/1) ... [2025-03-03 18:40:20,325 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:40:20" (1/1) ... [2025-03-03 18:40:20,326 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:40:20" (1/1) ... [2025-03-03 18:40:20,334 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:40:20" (1/1) ... [2025-03-03 18:40:20,336 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:40:20" (1/1) ... [2025-03-03 18:40:20,338 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:40:20,338 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:40:20,338 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:40:20,338 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:40:20,339 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:40:20" (1/1) ... [2025-03-03 18:40:20,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:40:20,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:40:20,364 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 18:40:20,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 18:40:20,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:40:20,380 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 18:40:20,380 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 18:40:20,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 18:40:20,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:40:20,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:40:20,430 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:40:20,431 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:40:20,639 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-03 18:40:20,639 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:40:20,645 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:40:20,646 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:40:20,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:40:20 BoogieIcfgContainer [2025-03-03 18:40:20,646 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:40:20,648 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:40:20,648 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:40:20,651 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:40:20,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:40:20" (1/3) ... [2025-03-03 18:40:20,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d56daed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:40:20, skipping insertion in model container [2025-03-03 18:40:20,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:40:20" (2/3) ... [2025-03-03 18:40:20,652 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d56daed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:40:20, skipping insertion in model container [2025-03-03 18:40:20,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:40:20" (3/3) ... [2025-03-03 18:40:20,653 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-66.i [2025-03-03 18:40:20,662 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:40:20,663 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-66.i that has 2 procedures, 57 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:40:20,701 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:40:20,709 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;@5fbed120, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:40:20,709 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:40:20,712 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 37 states have internal predecessors, (52), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 18:40:20,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 18:40:20,721 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:40:20,721 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:40:20,721 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:40:20,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:40:20,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1439087528, now seen corresponding path program 1 times [2025-03-03 18:40:20,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:40:20,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269420315] [2025-03-03 18:40:20,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:40:20,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:40:20,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 18:40:20,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 18:40:20,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:40:20,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:40:20,936 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-03 18:40:20,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:40:20,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269420315] [2025-03-03 18:40:20,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269420315] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:40:20,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118248160] [2025-03-03 18:40:20,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:40:20,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:40:20,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:40:20,941 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:40:20,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 18:40:21,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 18:40:21,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 18:40:21,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:40:21,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:40:21,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 18:40:21,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:40:21,104 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-03 18:40:21,105 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:40:21,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118248160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:40:21,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 18:40:21,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 18:40:21,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932773907] [2025-03-03 18:40:21,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:40:21,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 18:40:21,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:40:21,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 18:40:21,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 18:40:21,129 INFO L87 Difference]: Start difference. First operand has 57 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 37 states have internal predecessors, (52), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 18:40:21,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:40:21,151 INFO L93 Difference]: Finished difference Result 108 states and 189 transitions. [2025-03-03 18:40:21,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 18:40:21,153 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 116 [2025-03-03 18:40:21,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:40:21,158 INFO L225 Difference]: With dead ends: 108 [2025-03-03 18:40:21,159 INFO L226 Difference]: Without dead ends: 54 [2025-03-03 18:40:21,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 18:40:21,164 INFO L435 NwaCegarLoop]: 83 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, 83 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 18:40:21,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 18:40:21,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-03 18:40:21,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-03 18:40:21,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 states have internal predecessors, (47), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 18:40:21,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 83 transitions. [2025-03-03 18:40:21,192 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 83 transitions. Word has length 116 [2025-03-03 18:40:21,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:40:21,192 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 83 transitions. [2025-03-03 18:40:21,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 18:40:21,193 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 83 transitions. [2025-03-03 18:40:21,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 18:40:21,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:40:21,195 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:40:21,202 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-03 18:40:21,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 18:40:21,397 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:40:21,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:40:21,398 INFO L85 PathProgramCache]: Analyzing trace with hash 859373320, now seen corresponding path program 1 times [2025-03-03 18:40:21,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:40:21,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912949354] [2025-03-03 18:40:21,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:40:21,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:40:21,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 18:40:21,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 18:40:21,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:40:21,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:40:24,577 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-03 18:40:24,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:40:24,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912949354] [2025-03-03 18:40:24,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912949354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:40:24,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:40:24,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 18:40:24,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497643183] [2025-03-03 18:40:24,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:40:24,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 18:40:24,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:40:24,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 18:40:24,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2025-03-03 18:40:24,579 INFO L87 Difference]: Start difference. First operand 54 states and 83 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 18:40:25,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:40:25,139 INFO L93 Difference]: Finished difference Result 215 states and 316 transitions. [2025-03-03 18:40:25,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 18:40:25,140 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 116 [2025-03-03 18:40:25,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:40:25,142 INFO L225 Difference]: With dead ends: 215 [2025-03-03 18:40:25,143 INFO L226 Difference]: Without dead ends: 164 [2025-03-03 18:40:25,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-03 18:40:25,144 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 207 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:40:25,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 392 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:40:25,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-03 18:40:25,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 93. [2025-03-03 18:40:25,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.4558823529411764) internal successors, (99), 69 states have internal predecessors, (99), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 18:40:25,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 143 transitions. [2025-03-03 18:40:25,164 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 143 transitions. Word has length 116 [2025-03-03 18:40:25,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:40:25,165 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 143 transitions. [2025-03-03 18:40:25,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 18:40:25,165 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 143 transitions. [2025-03-03 18:40:25,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 18:40:25,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:40:25,168 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:40:25,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 18:40:25,168 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:40:25,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:40:25,169 INFO L85 PathProgramCache]: Analyzing trace with hash 860296841, now seen corresponding path program 1 times [2025-03-03 18:40:25,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:40:25,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862392976] [2025-03-03 18:40:25,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:40:25,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:40:25,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 18:40:25,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 18:40:25,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:40:25,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:40:28,132 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-03 18:40:28,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:40:28,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862392976] [2025-03-03 18:40:28,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862392976] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:40:28,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:40:28,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 18:40:28,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420725090] [2025-03-03 18:40:28,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:40:28,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 18:40:28,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:40:28,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 18:40:28,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2025-03-03 18:40:28,135 INFO L87 Difference]: Start difference. First operand 93 states and 143 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 18:40:33,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:40:33,419 INFO L93 Difference]: Finished difference Result 164 states and 228 transitions. [2025-03-03 18:40:33,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 18:40:33,420 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 116 [2025-03-03 18:40:33,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:40:33,421 INFO L225 Difference]: With dead ends: 164 [2025-03-03 18:40:33,421 INFO L226 Difference]: Without dead ends: 162 [2025-03-03 18:40:33,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-03 18:40:33,422 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 164 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:40:33,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 408 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:40:33,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-03 18:40:33,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 93. [2025-03-03 18:40:33,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.4558823529411764) internal successors, (99), 69 states have internal predecessors, (99), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 18:40:33,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 143 transitions. [2025-03-03 18:40:33,440 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 143 transitions. Word has length 116 [2025-03-03 18:40:33,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:40:33,441 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 143 transitions. [2025-03-03 18:40:33,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 18:40:33,441 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 143 transitions. [2025-03-03 18:40:33,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 18:40:33,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:40:33,444 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:40:33,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 18:40:33,444 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:40:33,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:40:33,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1692783641, now seen corresponding path program 1 times [2025-03-03 18:40:33,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:40:33,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300347062] [2025-03-03 18:40:33,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:40:33,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:40:33,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 18:40:33,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 18:40:33,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:40:33,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:40:36,804 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-03 18:40:36,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:40:36,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300347062] [2025-03-03 18:40:36,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300347062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:40:36,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:40:36,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 18:40:36,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884630139] [2025-03-03 18:40:36,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:40:36,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 18:40:36,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:40:36,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 18:40:36,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2025-03-03 18:40:36,807 INFO L87 Difference]: Start difference. First operand 93 states and 143 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 18:40:37,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:40:37,797 INFO L93 Difference]: Finished difference Result 170 states and 235 transitions. [2025-03-03 18:40:37,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 18:40:37,797 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 116 [2025-03-03 18:40:37,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:40:37,799 INFO L225 Difference]: With dead ends: 170 [2025-03-03 18:40:37,799 INFO L226 Difference]: Without dead ends: 168 [2025-03-03 18:40:37,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-03 18:40:37,799 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 182 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 18:40:37,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 407 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 18:40:37,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-03 18:40:37,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 96. [2025-03-03 18:40:37,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 72 states have internal predecessors, (104), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 18:40:37,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 148 transitions. [2025-03-03 18:40:37,808 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 148 transitions. Word has length 116 [2025-03-03 18:40:37,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:40:37,808 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 148 transitions. [2025-03-03 18:40:37,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 18:40:37,811 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 148 transitions. [2025-03-03 18:40:37,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 18:40:37,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:40:37,812 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:40:37,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 18:40:37,813 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:40:37,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:40:37,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1691860120, now seen corresponding path program 1 times [2025-03-03 18:40:37,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:40:37,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650441398] [2025-03-03 18:40:37,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:40:37,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:40:37,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 18:40:37,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 18:40:37,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:40:37,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:41:00,754 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-03 18:41:00,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:41:00,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650441398] [2025-03-03 18:41:00,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650441398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:41:00,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:41:00,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 18:41:00,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429085961] [2025-03-03 18:41:00,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:41:00,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 18:41:00,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:41:00,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 18:41:00,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-03-03 18:41:00,756 INFO L87 Difference]: Start difference. First operand 96 states and 148 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 18:41:04,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:41:04,005 INFO L93 Difference]: Finished difference Result 140 states and 201 transitions. [2025-03-03 18:41:04,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 18:41:04,006 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 116 [2025-03-03 18:41:04,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:41:04,008 INFO L225 Difference]: With dead ends: 140 [2025-03-03 18:41:04,008 INFO L226 Difference]: Without dead ends: 138 [2025-03-03 18:41:04,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2025-03-03 18:41:04,010 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 92 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:41:04,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 402 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 18:41:04,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-03 18:41:04,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 95. [2025-03-03 18:41:04,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 70 states have (on average 1.457142857142857) internal successors, (102), 71 states have internal predecessors, (102), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 18:41:04,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 146 transitions. [2025-03-03 18:41:04,022 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 146 transitions. Word has length 116 [2025-03-03 18:41:04,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:41:04,022 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 146 transitions. [2025-03-03 18:41:04,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 18:41:04,023 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 146 transitions. [2025-03-03 18:41:04,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 18:41:04,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:41:04,023 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:41:04,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 18:41:04,024 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:41:04,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:41:04,024 INFO L85 PathProgramCache]: Analyzing trace with hash 662859815, now seen corresponding path program 1 times [2025-03-03 18:41:04,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:41:04,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383659168] [2025-03-03 18:41:04,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:41:04,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:41:04,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 18:41:04,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 18:41:04,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:41:04,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:41:04,058 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-03 18:41:04,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:41:04,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383659168] [2025-03-03 18:41:04,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383659168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:41:04,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:41:04,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 18:41:04,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175278297] [2025-03-03 18:41:04,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:41:04,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 18:41:04,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:41:04,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 18:41:04,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 18:41:04,060 INFO L87 Difference]: Start difference. First operand 95 states and 146 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 18:41:04,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:41:04,111 INFO L93 Difference]: Finished difference Result 261 states and 404 transitions. [2025-03-03 18:41:04,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 18:41:04,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 116 [2025-03-03 18:41:04,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:41:04,114 INFO L225 Difference]: With dead ends: 261 [2025-03-03 18:41:04,115 INFO L226 Difference]: Without dead ends: 169 [2025-03-03 18:41:04,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 18:41:04,118 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 71 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 18:41:04,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 213 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 18:41:04,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-03 18:41:04,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167. [2025-03-03 18:41:04,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 118 states have (on average 1.3728813559322033) internal successors, (162), 120 states have internal predecessors, (162), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-03 18:41:04,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 250 transitions. [2025-03-03 18:41:04,149 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 250 transitions. Word has length 116 [2025-03-03 18:41:04,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:41:04,149 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 250 transitions. [2025-03-03 18:41:04,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 18:41:04,150 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 250 transitions. [2025-03-03 18:41:04,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 18:41:04,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:41:04,151 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:41:04,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 18:41:04,152 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:41:04,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:41:04,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1550363496, now seen corresponding path program 1 times [2025-03-03 18:41:04,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:41:04,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738201065] [2025-03-03 18:41:04,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:41:04,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:41:04,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 18:41:04,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 18:41:04,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:41:04,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:41:04,210 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-03 18:41:04,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:41:04,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738201065] [2025-03-03 18:41:04,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738201065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:41:04,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:41:04,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:41:04,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749649798] [2025-03-03 18:41:04,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:41:04,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:41:04,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:41:04,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:41:04,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:41:04,213 INFO L87 Difference]: Start difference. First operand 167 states and 250 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 18:41:04,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:41:04,384 INFO L93 Difference]: Finished difference Result 494 states and 727 transitions. [2025-03-03 18:41:04,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:41:04,385 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 116 [2025-03-03 18:41:04,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:41:04,387 INFO L225 Difference]: With dead ends: 494 [2025-03-03 18:41:04,387 INFO L226 Difference]: Without dead ends: 330 [2025-03-03 18:41:04,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:41:04,388 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 68 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:41:04,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 206 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:41:04,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-03-03 18:41:04,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 287. [2025-03-03 18:41:04,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 194 states have (on average 1.3350515463917525) internal successors, (259), 197 states have internal predecessors, (259), 84 states have call successors, (84), 8 states have call predecessors, (84), 8 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-03 18:41:04,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 427 transitions. [2025-03-03 18:41:04,421 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 427 transitions. Word has length 116 [2025-03-03 18:41:04,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:41:04,421 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 427 transitions. [2025-03-03 18:41:04,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 18:41:04,422 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 427 transitions. [2025-03-03 18:41:04,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 18:41:04,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:41:04,423 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:41:04,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 18:41:04,423 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:41:04,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:41:04,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1001793465, now seen corresponding path program 1 times [2025-03-03 18:41:04,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:41:04,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546122400] [2025-03-03 18:41:04,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:41:04,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:41:04,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 18:41:04,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 18:41:04,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:41:04,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:41:06,098 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-03 18:41:06,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:41:06,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546122400] [2025-03-03 18:41:06,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546122400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:41:06,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:41:06,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 18:41:06,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959757282] [2025-03-03 18:41:06,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:41:06,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 18:41:06,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:41:06,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 18:41:06,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:41:06,100 INFO L87 Difference]: Start difference. First operand 287 states and 427 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 18:41:07,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:41:07,002 INFO L93 Difference]: Finished difference Result 519 states and 705 transitions. [2025-03-03 18:41:07,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 18:41:07,004 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 116 [2025-03-03 18:41:07,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:41:07,007 INFO L225 Difference]: With dead ends: 519 [2025-03-03 18:41:07,007 INFO L226 Difference]: Without dead ends: 517 [2025-03-03 18:41:07,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2025-03-03 18:41:07,008 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 198 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 18:41:07,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 466 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 18:41:07,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-03-03 18:41:07,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 337. [2025-03-03 18:41:07,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 238 states have (on average 1.3277310924369747) internal successors, (316), 243 states have internal predecessors, (316), 88 states have call successors, (88), 10 states have call predecessors, (88), 10 states have return successors, (88), 83 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-03 18:41:07,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 492 transitions. [2025-03-03 18:41:07,039 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 492 transitions. Word has length 116 [2025-03-03 18:41:07,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:41:07,039 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 492 transitions. [2025-03-03 18:41:07,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 18:41:07,040 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 492 transitions. [2025-03-03 18:41:07,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 18:41:07,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:41:07,041 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:41:07,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 18:41:07,041 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:41:07,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:41:07,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1000869944, now seen corresponding path program 1 times [2025-03-03 18:41:07,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:41:07,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191271087] [2025-03-03 18:41:07,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:41:07,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:41:07,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 18:41:07,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 18:41:07,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:41:07,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:41:09,685 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-03 18:41:09,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:41:09,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191271087] [2025-03-03 18:41:09,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191271087] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:41:09,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:41:09,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 18:41:09,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527519213] [2025-03-03 18:41:09,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:41:09,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 18:41:09,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:41:09,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 18:41:09,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:41:09,686 INFO L87 Difference]: Start difference. First operand 337 states and 492 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 18:41:10,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:41:10,849 INFO L93 Difference]: Finished difference Result 517 states and 702 transitions. [2025-03-03 18:41:10,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 18:41:10,850 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 116 [2025-03-03 18:41:10,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:41:10,852 INFO L225 Difference]: With dead ends: 517 [2025-03-03 18:41:10,852 INFO L226 Difference]: Without dead ends: 515 [2025-03-03 18:41:10,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2025-03-03 18:41:10,853 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 187 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 18:41:10,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 572 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 18:41:10,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2025-03-03 18:41:10,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 337. [2025-03-03 18:41:10,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 238 states have (on average 1.3277310924369747) internal successors, (316), 243 states have internal predecessors, (316), 88 states have call successors, (88), 10 states have call predecessors, (88), 10 states have return successors, (88), 83 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-03 18:41:10,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 492 transitions. [2025-03-03 18:41:10,893 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 492 transitions. Word has length 116 [2025-03-03 18:41:10,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:41:10,893 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 492 transitions. [2025-03-03 18:41:10,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 18:41:10,893 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 492 transitions. [2025-03-03 18:41:10,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 18:41:10,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:41:10,894 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:41:10,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 18:41:10,894 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:41:10,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:41:10,895 INFO L85 PathProgramCache]: Analyzing trace with hash -937578039, now seen corresponding path program 1 times [2025-03-03 18:41:10,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:41:10,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342091789] [2025-03-03 18:41:10,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:41:10,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:41:10,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 18:41:10,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 18:41:10,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:41:10,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:41:11,070 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-03 18:41:11,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:41:11,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342091789] [2025-03-03 18:41:11,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342091789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:41:11,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:41:11,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:41:11,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462905745] [2025-03-03 18:41:11,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:41:11,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:41:11,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:41:11,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:41:11,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:41:11,072 INFO L87 Difference]: Start difference. First operand 337 states and 492 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-03 18:41:11,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:41:11,296 INFO L93 Difference]: Finished difference Result 664 states and 951 transitions. [2025-03-03 18:41:11,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:41:11,297 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 116 [2025-03-03 18:41:11,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:41:11,299 INFO L225 Difference]: With dead ends: 664 [2025-03-03 18:41:11,300 INFO L226 Difference]: Without dead ends: 371 [2025-03-03 18:41:11,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:41:11,301 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 191 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:41:11,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 119 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:41:11,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-03-03 18:41:11,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 364. [2025-03-03 18:41:11,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 251 states have (on average 1.2629482071713147) internal successors, (317), 257 states have internal predecessors, (317), 98 states have call successors, (98), 14 states have call predecessors, (98), 14 states have return successors, (98), 92 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-03 18:41:11,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 513 transitions. [2025-03-03 18:41:11,339 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 513 transitions. Word has length 116 [2025-03-03 18:41:11,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:41:11,339 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 513 transitions. [2025-03-03 18:41:11,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-03 18:41:11,340 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 513 transitions. [2025-03-03 18:41:11,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-03 18:41:11,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:41:11,341 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:41:11,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 18:41:11,341 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:41:11,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:41:11,341 INFO L85 PathProgramCache]: Analyzing trace with hash 2026292547, now seen corresponding path program 1 times [2025-03-03 18:41:11,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:41:11,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678806476] [2025-03-03 18:41:11,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:41:11,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:41:11,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-03 18:41:11,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-03 18:41:11,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:41:11,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 18:41:11,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [470898874] [2025-03-03 18:41:11,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:41:11,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:41:11,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:41:11,385 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:41:11,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 18:41:11,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-03 18:41:11,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-03 18:41:11,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:41:11,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:41:11,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-03 18:41:11,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:41:13,458 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 400 proven. 102 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-03-03 18:41:13,458 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:41:26,375 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (< 0 (+ c_~var_1_6~0 65))) (.cse4 (mod c_~var_1_10~0 65536)) (.cse3 (* (- 1) c_~var_1_7~0)) (.cse7 (< 32703 c_~var_1_6~0)) (.cse2 (mod (+ c_~var_1_6~0 (* 65535 c_~var_1_7~0)) 65536))) (and (or .cse0 (forall ((v_z_39 Int)) (let ((.cse1 (div (+ v_z_39 .cse3) .cse4))) (or (< 0 (+ c_~var_1_6~0 66 v_z_39 .cse1)) (< 32766 (+ .cse1 .cse2)) (< v_z_39 c_~var_1_7~0) (< 0 (+ c_~var_1_6~0 66 .cse1 .cse2)) (< 32766 (+ v_z_39 .cse1)) (< v_z_39 32767) (< 65535 v_z_39))))) (or (forall ((v_z_31 Int)) (let ((.cse5 (div (+ v_z_31 .cse3) .cse4))) (or (< v_z_31 32767) (< 65535 v_z_31) (< 32765 (+ v_z_31 .cse5)) (< 32765 (+ .cse2 .cse5)) (< 0 (+ c_~var_1_6~0 67 .cse2 .cse5)) (< 0 (+ c_~var_1_6~0 v_z_31 67 .cse5))))) .cse0) (or (forall ((v_z_25 Int)) (let ((.cse6 (div (+ v_z_25 .cse3) .cse4))) (or (< 0 (+ .cse6 v_z_25 2)) (< v_z_25 32767) (< 65535 v_z_25) (< 0 (+ c_~var_1_6~0 .cse6 66 v_z_25)) (< 0 (+ c_~var_1_6~0 .cse6 66 .cse2)) (< v_z_25 c_~var_1_7~0)))) .cse7) (or .cse7 (forall ((v_z_35 Int)) (let ((.cse8 (div (+ v_z_35 .cse3) .cse4))) (or (< 0 (+ c_~var_1_6~0 .cse8 67 .cse2)) (< 0 (+ c_~var_1_6~0 .cse8 v_z_35 67)) (< 0 (+ .cse8 v_z_35 3)) (< v_z_35 32767) (< 65535 v_z_35))))) (or (forall ((v_z_45 Int)) (let ((.cse9 (+ v_z_45 .cse3))) (let ((.cse10 (div .cse9 .cse4))) (or (not (= (mod .cse9 .cse4) 0)) (< v_z_45 32767) (< 65535 v_z_45) (< 32766 (+ .cse10 .cse2)) (< 0 (+ c_~var_1_6~0 .cse10 66 v_z_45)) (< 32766 (+ .cse10 v_z_45)) (< 0 (+ c_~var_1_6~0 .cse10 66 .cse2)))))) .cse0) (or .cse7 (forall ((v_z_77 Int)) (let ((.cse12 (+ v_z_77 .cse3))) (let ((.cse11 (div .cse12 .cse4))) (or (< 0 (+ c_~var_1_6~0 66 .cse2 .cse11)) (not (= (mod .cse12 .cse4) 0)) (< 0 (+ c_~var_1_6~0 66 v_z_77 .cse11)) (< 65535 v_z_77) (< v_z_77 32767) (< 0 (+ v_z_77 2 .cse11))))))) (or (and (or .cse7 (forall ((v_z_66 Int)) (let ((.cse13 (div (+ v_z_66 .cse3) .cse4))) (or (< 0 (+ v_z_66 .cse13 2)) (< 65535 v_z_66) (< v_z_66 c_~var_1_7~0) (< 0 (+ c_~var_1_6~0 66 v_z_66 .cse13)) (< v_z_66 32767))))) (or (forall ((v_z_60 Int)) (let ((.cse14 (div (+ v_z_60 .cse3) .cse4))) (or (< 65535 v_z_60) (< 0 (+ c_~var_1_6~0 v_z_60 67 .cse14)) (< 32765 (+ v_z_60 .cse14)) (< v_z_60 32767)))) .cse0) (or (forall ((v_z_63 Int)) (let ((.cse15 (div (+ v_z_63 .cse3) .cse4))) (or (< 0 (+ c_~var_1_6~0 .cse15 v_z_63 67)) (< 0 (+ .cse15 v_z_63 3)) (< 65535 v_z_63) (< v_z_63 32767)))) .cse7) (or .cse0 (forall ((v_z_70 Int)) (let ((.cse17 (+ v_z_70 .cse3))) (let ((.cse16 (div .cse17 .cse4))) (or (< 0 (+ c_~var_1_6~0 66 v_z_70 .cse16)) (< v_z_70 32767) (< 65535 v_z_70) (< 32766 (+ v_z_70 .cse16)) (not (= (mod .cse17 .cse4) 0))))))) (or .cse0 (forall ((v_z_52 Int)) (let ((.cse18 (div (+ v_z_52 .cse3) .cse4))) (or (< v_z_52 c_~var_1_7~0) (< 0 (+ c_~var_1_6~0 66 v_z_52 .cse18)) (< 65535 v_z_52) (< v_z_52 32767) (< 32766 (+ v_z_52 .cse18)))))) (or (forall ((v_z_58 Int)) (let ((.cse20 (+ v_z_58 .cse3))) (let ((.cse19 (div .cse20 .cse4))) (or (< 65535 v_z_58) (< v_z_58 32767) (< 0 (+ v_z_58 2 .cse19)) (< 0 (+ c_~var_1_6~0 66 v_z_58 .cse19)) (not (= (mod .cse20 .cse4) 0)))))) .cse7)) (< .cse2 32768)))) is different from false [2025-03-03 18:41:26,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:41:26,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678806476] [2025-03-03 18:41:26,396 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 18:41:26,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470898874] [2025-03-03 18:41:26,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470898874] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:41:26,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 18:41:26,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2025-03-03 18:41:26,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688412295] [2025-03-03 18:41:26,397 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 18:41:26,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-03 18:41:26,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:41:26,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-03 18:41:26,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=379, Unknown=1, NotChecked=42, Total=552 [2025-03-03 18:41:26,398 INFO L87 Difference]: Start difference. First operand 364 states and 513 transitions. Second operand has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 7 states have call successors, (18), 7 states have call predecessors, (18), 9 states have return successors, (18), 5 states have call predecessors, (18), 7 states have call successors, (18) [2025-03-03 18:41:28,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:41:28,994 INFO L93 Difference]: Finished difference Result 820 states and 1061 transitions. [2025-03-03 18:41:28,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-03 18:41:28,995 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 7 states have call successors, (18), 7 states have call predecessors, (18), 9 states have return successors, (18), 5 states have call predecessors, (18), 7 states have call successors, (18) Word has length 117 [2025-03-03 18:41:28,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:41:28,998 INFO L225 Difference]: With dead ends: 820 [2025-03-03 18:41:28,998 INFO L226 Difference]: Without dead ends: 497 [2025-03-03 18:41:28,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=546, Invalid=1713, Unknown=1, NotChecked=92, Total=2352 [2025-03-03 18:41:28,999 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 143 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 18:41:29,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 251 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 18:41:29,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2025-03-03 18:41:29,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 260. [2025-03-03 18:41:29,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 190 states have (on average 1.1736842105263159) internal successors, (223), 193 states have internal predecessors, (223), 48 states have call successors, (48), 21 states have call predecessors, (48), 21 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 18:41:29,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 319 transitions. [2025-03-03 18:41:29,039 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 319 transitions. Word has length 117 [2025-03-03 18:41:29,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:41:29,039 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 319 transitions. [2025-03-03 18:41:29,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 7 states have call successors, (18), 7 states have call predecessors, (18), 9 states have return successors, (18), 5 states have call predecessors, (18), 7 states have call successors, (18) [2025-03-03 18:41:29,039 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 319 transitions. [2025-03-03 18:41:29,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-03 18:41:29,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:41:29,040 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:41:29,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 18:41:29,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-03 18:41:29,244 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:41:29,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:41:29,244 INFO L85 PathProgramCache]: Analyzing trace with hash 2027216068, now seen corresponding path program 1 times [2025-03-03 18:41:29,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:41:29,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814329848] [2025-03-03 18:41:29,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:41:29,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:41:29,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-03 18:41:29,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-03 18:41:29,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:41:29,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 18:41:29,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1675788497] [2025-03-03 18:41:29,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:41:29,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:41:29,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:41:29,290 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:41:29,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 18:41:29,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-03 18:41:29,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-03 18:41:29,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:41:29,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 18:41:29,364 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 18:41:29,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-03 18:41:29,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-03 18:41:29,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:41:29,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 18:41:29,446 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 18:41:29,446 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 18:41:29,447 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 18:41:29,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 18:41:29,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:41:29,653 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:41:29,717 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 18:41:29,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 06:41:29 BoogieIcfgContainer [2025-03-03 18:41:29,721 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 18:41:29,722 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 18:41:29,722 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 18:41:29,722 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 18:41:29,723 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:40:20" (3/4) ... [2025-03-03 18:41:29,724 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 18:41:29,725 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 18:41:29,726 INFO L158 Benchmark]: Toolchain (without parser) took 69698.09ms. Allocated memory was 142.6MB in the beginning and 721.4MB in the end (delta: 578.8MB). Free memory was 109.9MB in the beginning and 268.1MB in the end (delta: -158.3MB). Peak memory consumption was 420.0MB. Max. memory is 16.1GB. [2025-03-03 18:41:29,727 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:41:29,727 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.94ms. Allocated memory is still 142.6MB. Free memory was 109.9MB in the beginning and 95.9MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 18:41:29,727 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.93ms. Allocated memory is still 142.6MB. Free memory was 95.9MB in the beginning and 93.6MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:41:29,728 INFO L158 Benchmark]: Boogie Preprocessor took 51.84ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 90.2MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:41:29,728 INFO L158 Benchmark]: IcfgBuilder took 308.06ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 70.7MB in the end (delta: 19.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 18:41:29,728 INFO L158 Benchmark]: TraceAbstraction took 69073.50ms. Allocated memory was 142.6MB in the beginning and 721.4MB in the end (delta: 578.8MB). Free memory was 69.6MB in the beginning and 268.4MB in the end (delta: -198.8MB). Peak memory consumption was 378.1MB. Max. memory is 16.1GB. [2025-03-03 18:41:29,728 INFO L158 Benchmark]: Witness Printer took 2.78ms. Allocated memory is still 721.4MB. Free memory was 268.4MB in the beginning and 268.1MB in the end (delta: 230.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:41:29,730 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.42ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 217.94ms. Allocated memory is still 142.6MB. Free memory was 109.9MB in the beginning and 95.9MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.93ms. Allocated memory is still 142.6MB. Free memory was 95.9MB in the beginning and 93.6MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.84ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 90.2MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 308.06ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 70.7MB in the end (delta: 19.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 69073.50ms. Allocated memory was 142.6MB in the beginning and 721.4MB in the end (delta: 578.8MB). Free memory was 69.6MB in the beginning and 268.4MB in the end (delta: -198.8MB). Peak memory consumption was 378.1MB. Max. memory is 16.1GB. * Witness Printer took 2.78ms. Allocated memory is still 721.4MB. Free memory was 268.4MB in the beginning and 268.1MB in the end (delta: 230.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 115. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 50; [L23] signed char var_1_3 = 8; [L24] signed char var_1_4 = 10; [L25] double var_1_5 = 16.5; [L26] signed char var_1_6 = 64; [L27] signed char var_1_7 = 2; [L28] unsigned short int var_1_8 = 256; [L29] unsigned short int var_1_10 = 63583; [L30] unsigned short int var_1_11 = 33789; [L31] unsigned char var_1_12 = 1; [L32] unsigned char var_1_14 = 0; [L33] signed long int var_1_15 = 8; [L34] signed short int var_1_16 = -16; [L35] signed short int var_1_18 = 16; [L36] signed short int var_1_19 = 25; [L37] signed short int var_1_20 = 25; [L38] signed short int var_1_21 = 50; [L39] unsigned char last_1_var_1_12 = 1; VAL [isInitial=0, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L119] isInitial = 1 [L120] FCALL initially() [L121] COND TRUE 1 [L122] CALL updateLastVariables() [L112] last_1_var_1_12 = var_1_12 VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L122] RET updateLastVariables() [L123] CALL updateVariables() [L83] var_1_3 = __VERIFIER_nondet_char() [L84] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L84] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L85] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L85] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L86] var_1_4 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_4 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L87] RET assume_abort_if_not(var_1_4 >= -63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L88] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L88] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L89] var_1_6 = __VERIFIER_nondet_char() [L90] CALL assume_abort_if_not(var_1_6 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256] [L90] RET assume_abort_if_not(var_1_6 >= -1) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256] [L91] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256] [L91] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256] [L92] var_1_7 = __VERIFIER_nondet_char() [L93] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L93] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L94] CALL assume_abort_if_not(var_1_7 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L94] RET assume_abort_if_not(var_1_7 <= 127) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L95] var_1_10 = __VERIFIER_nondet_ushort() [L96] CALL assume_abort_if_not(var_1_10 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L96] RET assume_abort_if_not(var_1_10 >= 49150) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L97] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L97] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L98] var_1_11 = __VERIFIER_nondet_ushort() [L99] CALL assume_abort_if_not(var_1_11 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L99] RET assume_abort_if_not(var_1_11 >= 32767) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L100] CALL assume_abort_if_not(var_1_11 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L100] RET assume_abort_if_not(var_1_11 <= 65534) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L101] var_1_14 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L102] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L103] CALL assume_abort_if_not(var_1_14 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L103] RET assume_abort_if_not(var_1_14 <= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L104] var_1_20 = __VERIFIER_nondet_short() [L105] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L105] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L106] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L106] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=50, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L107] var_1_21 = __VERIFIER_nondet_short() [L108] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=190, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=190, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L108] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=190, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L109] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=190, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=190, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L109] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=190, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L123] RET updateVariables() [L124] CALL step() [L43] COND FALSE !(-25 == var_1_6) [L48] var_1_8 = ((((var_1_7) > (var_1_11)) ? (var_1_7) : (var_1_11))) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=190, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=32767] [L50] COND TRUE var_1_8 >= var_1_7 [L51] var_1_12 = (! var_1_14) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=190, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=32767] [L53] COND TRUE \read(var_1_12) [L54] var_1_1 = (var_1_3 + var_1_4) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-126, var_1_20=190, var_1_21=190, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=32767] [L56] COND TRUE var_1_4 >= (var_1_6 - var_1_7) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-126, var_1_20=190, var_1_21=190, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=32767] [L57] COND TRUE \read(var_1_12) [L58] var_1_5 = 8.25 VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-126, var_1_20=190, var_1_21=190, var_1_3=-63, var_1_4=-63, var_1_5=33/4, var_1_6=-1, var_1_7=127, var_1_8=32767] [L61] COND TRUE var_1_1 < var_1_6 [L62] var_1_18 = (var_1_6 - var_1_7) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=-128, var_1_19=25, var_1_1=-126, var_1_20=190, var_1_21=190, var_1_3=-63, var_1_4=-63, var_1_5=33/4, var_1_6=-1, var_1_7=127, var_1_8=32767] [L66] COND TRUE \read(var_1_12) [L67] var_1_19 = ((var_1_7 - ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21)))) + var_1_6) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=-128, var_1_19=-64, var_1_1=-126, var_1_20=190, var_1_21=190, var_1_3=-63, var_1_4=-63, var_1_5=33/4, var_1_6=-1, var_1_7=127, var_1_8=32767] [L69] COND TRUE -64 > (var_1_6 + var_1_19) [L70] var_1_15 = (var_1_11 - var_1_7) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=32640, var_1_16=-16, var_1_18=-128, var_1_19=-64, var_1_1=-126, var_1_20=190, var_1_21=190, var_1_3=-63, var_1_4=-63, var_1_5=33/4, var_1_6=-1, var_1_7=127, var_1_8=32767] [L78] COND FALSE !(var_1_19 > (((((var_1_11) > (var_1_18)) ? (var_1_11) : (var_1_18))) + (var_1_15 / var_1_10))) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=32640, var_1_16=-16, var_1_18=-128, var_1_19=-64, var_1_1=-126, var_1_20=190, var_1_21=190, var_1_3=-63, var_1_4=-63, var_1_5=33/4, var_1_6=-1, var_1_7=127, var_1_8=32767] [L124] RET step() [L125] CALL, EXPR property() [L115-L116] return (((((((var_1_12 ? (var_1_1 == ((signed char) (var_1_3 + var_1_4))) : 1) && ((var_1_4 >= (var_1_6 - var_1_7)) ? (var_1_12 ? (var_1_5 == ((double) 8.25)) : 1) : 1)) && ((-25 == var_1_6) ? ((last_1_var_1_12 && last_1_var_1_12) ? (var_1_8 == ((unsigned short int) ((((((var_1_10 - 10) - 16)) > ((var_1_11 - var_1_7))) ? (((var_1_10 - 10) - 16)) : ((var_1_11 - var_1_7)))))) : 1) : (var_1_8 == ((unsigned short int) ((((var_1_7) > (var_1_11)) ? (var_1_7) : (var_1_11))))))) && ((var_1_8 >= var_1_7) ? (var_1_12 == ((unsigned char) (! var_1_14))) : 1)) && ((-64 > (var_1_6 + var_1_19)) ? (var_1_15 == ((signed long int) (var_1_11 - var_1_7))) : ((! var_1_12) ? (var_1_12 ? (var_1_15 == ((signed long int) 4)) : 1) : 1))) && ((var_1_19 > (((((var_1_11) > (var_1_18)) ? (var_1_11) : (var_1_18))) + (var_1_15 / var_1_10))) ? (var_1_16 == ((signed short int) var_1_4)) : 1)) && ((var_1_1 < var_1_6) ? (var_1_18 == ((signed short int) (var_1_6 - var_1_7))) : (var_1_18 == ((signed short int) (((((var_1_6 + var_1_4)) < (var_1_1)) ? ((var_1_6 + var_1_4)) : (var_1_1))))))) && (var_1_12 ? (var_1_19 == ((signed short int) ((var_1_7 - ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21)))) + var_1_6))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=32640, var_1_16=-16, var_1_18=-128, var_1_19=-64, var_1_1=-126, var_1_20=190, var_1_21=190, var_1_3=-63, var_1_4=-63, var_1_5=33/4, var_1_6=-1, var_1_7=127, var_1_8=32767] [L125] RET, EXPR property() [L125] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=32640, var_1_16=-16, var_1_18=-128, var_1_19=-64, var_1_1=-126, var_1_20=190, var_1_21=190, var_1_3=-63, var_1_4=-63, var_1_5=33/4, var_1_6=-1, var_1_7=127, var_1_8=32767] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=32640, var_1_16=-16, var_1_18=-128, var_1_19=-64, var_1_1=-126, var_1_20=190, var_1_21=190, var_1_3=-63, var_1_4=-63, var_1_5=33/4, var_1_6=-1, var_1_7=127, var_1_8=32767] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 69.0s, OverallIterations: 12, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 15.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1515 SdHoareTripleChecker+Valid, 5.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1503 mSDsluCounter, 3519 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2548 mSDsCounter, 123 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2494 IncrementalHoareTripleChecker+Invalid, 2617 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 123 mSolverCounterUnsat, 971 mSDtfsCounter, 2494 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 416 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 21.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=364occurred in iteration=10, InterpolantAutomatonStates: 126, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 902 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 51.7s InterpolantComputationTime, 1744 NumberOfCodeBlocks, 1744 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1381 ConstructedInterpolants, 0 QuantifiedInterpolants, 10869 SizeOfPredicates, 10 NumberOfNonLiveVariables, 557 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 7208/7344 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 18:41:29,941 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-03-03 18:41:29,989 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 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-66.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 3528376fb447b7e4334860ab48f714a16089e5384cb298e6197e1f3cf82dfcc6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:41:31,624 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:41:31,714 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 18:41:31,721 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:41:31,721 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:41:31,744 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:41:31,745 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:41:31,746 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:41:31,746 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:41:31,746 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:41:31,747 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:41:31,747 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:41:31,747 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:41:31,747 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:41:31,748 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:41:31,748 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:41:31,748 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:41:31,748 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 18:41:31,748 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 18:41:31,748 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:41:31,749 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:41:31,749 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:41:31,749 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:41:31,749 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 18:41:31,749 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 18:41:31,749 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 18:41:31,749 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 18:41:31,749 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:41:31,749 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:41:31,749 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:41:31,750 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:41:31,750 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:41:31,750 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:41:31,750 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:41:31,750 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:41:31,750 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:41:31,750 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:41:31,750 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:41:31,750 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:41:31,750 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 18:41:31,751 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 18:41:31,751 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:41:31,751 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:41:31,751 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:41:31,751 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:41:31,751 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 -> 3528376fb447b7e4334860ab48f714a16089e5384cb298e6197e1f3cf82dfcc6 [2025-03-03 18:41:32,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:41:32,021 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:41:32,023 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:41:32,024 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:41:32,025 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:41:32,026 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-66.i [2025-03-03 18:41:33,155 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20c127a1e/a9ee147e051842e69c069be0eb11f7a6/FLAG2342fda57 [2025-03-03 18:41:33,346 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:41:33,347 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-66.i [2025-03-03 18:41:33,354 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20c127a1e/a9ee147e051842e69c069be0eb11f7a6/FLAG2342fda57 [2025-03-03 18:41:33,719 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20c127a1e/a9ee147e051842e69c069be0eb11f7a6 [2025-03-03 18:41:33,722 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:41:33,723 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:41:33,725 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:41:33,725 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:41:33,728 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:41:33,728 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:41:33" (1/1) ... [2025-03-03 18:41:33,729 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72e291be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:41:33, skipping insertion in model container [2025-03-03 18:41:33,729 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:41:33" (1/1) ... [2025-03-03 18:41:33,739 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:41:33,838 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-66.i[919,932] [2025-03-03 18:41:33,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:41:33,886 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:41:33,894 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-66.i[919,932] [2025-03-03 18:41:33,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:41:33,922 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:41:33,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:41:33 WrapperNode [2025-03-03 18:41:33,923 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:41:33,924 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:41:33,924 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:41:33,924 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:41:33,928 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:41:33" (1/1) ... [2025-03-03 18:41:33,935 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:41:33" (1/1) ... [2025-03-03 18:41:33,959 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2025-03-03 18:41:33,960 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:41:33,960 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:41:33,960 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:41:33,961 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:41:33,967 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:41:33" (1/1) ... [2025-03-03 18:41:33,968 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:41:33" (1/1) ... [2025-03-03 18:41:33,973 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:41:33" (1/1) ... [2025-03-03 18:41:33,989 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 18:41:33,990 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:41:33" (1/1) ... [2025-03-03 18:41:33,990 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:41:33" (1/1) ... [2025-03-03 18:41:34,002 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:41:33" (1/1) ... [2025-03-03 18:41:34,002 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:41:33" (1/1) ... [2025-03-03 18:41:34,005 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:41:33" (1/1) ... [2025-03-03 18:41:34,005 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:41:33" (1/1) ... [2025-03-03 18:41:34,007 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:41:34,012 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:41:34,012 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:41:34,012 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:41:34,016 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:41:33" (1/1) ... [2025-03-03 18:41:34,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:41:34,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:41:34,046 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 18:41:34,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-03 18:41:34,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:41:34,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 18:41:34,064 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 18:41:34,064 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 18:41:34,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:41:34,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:41:34,118 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:41:34,120 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:41:34,364 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-03 18:41:34,365 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:41:34,373 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:41:34,374 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:41:34,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:41:34 BoogieIcfgContainer [2025-03-03 18:41:34,374 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:41:34,376 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:41:34,376 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:41:34,379 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:41:34,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:41:33" (1/3) ... [2025-03-03 18:41:34,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@545bf18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:41:34, skipping insertion in model container [2025-03-03 18:41:34,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:41:33" (2/3) ... [2025-03-03 18:41:34,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@545bf18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:41:34, skipping insertion in model container [2025-03-03 18:41:34,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:41:34" (3/3) ... [2025-03-03 18:41:34,383 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-66.i [2025-03-03 18:41:34,393 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:41:34,394 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-66.i that has 2 procedures, 57 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:41:34,431 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:41:34,441 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;@5070a894, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:41:34,441 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:41:34,446 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 37 states have internal predecessors, (52), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 18:41:34,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 18:41:34,453 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:41:34,453 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:41:34,453 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:41:34,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:41:34,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1439087528, now seen corresponding path program 1 times [2025-03-03 18:41:34,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:41:34,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [343245276] [2025-03-03 18:41:34,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:41:34,465 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 18:41:34,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 18:41:34,467 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 18:41:34,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 18:41:34,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 18:41:34,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 18:41:34,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:41:34,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:41:34,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 18:41:34,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:41:34,664 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-03-03 18:41:34,665 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:41:34,665 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 18:41:34,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [343245276] [2025-03-03 18:41:34,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [343245276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:41:34,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:41:34,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 18:41:34,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269279908] [2025-03-03 18:41:34,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:41:34,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 18:41:34,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 18:41:34,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 18:41:34,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 18:41:34,686 INFO L87 Difference]: Start difference. First operand has 57 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 37 states have internal predecessors, (52), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 18:41:34,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:41:34,706 INFO L93 Difference]: Finished difference Result 108 states and 189 transitions. [2025-03-03 18:41:34,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 18:41:34,708 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 116 [2025-03-03 18:41:34,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:41:34,714 INFO L225 Difference]: With dead ends: 108 [2025-03-03 18:41:34,714 INFO L226 Difference]: Without dead ends: 54 [2025-03-03 18:41:34,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 18:41:34,720 INFO L435 NwaCegarLoop]: 83 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, 83 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 18:41:34,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 18:41:34,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-03 18:41:34,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-03 18:41:34,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 states have internal predecessors, (47), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 18:41:34,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 83 transitions. [2025-03-03 18:41:34,753 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 83 transitions. Word has length 116 [2025-03-03 18:41:34,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:41:34,753 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 83 transitions. [2025-03-03 18:41:34,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 18:41:34,754 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 83 transitions. [2025-03-03 18:41:34,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 18:41:34,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:41:34,756 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:41:34,762 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-03 18:41:34,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 18:41:34,957 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:41:34,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:41:34,958 INFO L85 PathProgramCache]: Analyzing trace with hash 859373320, now seen corresponding path program 1 times [2025-03-03 18:41:34,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:41:34,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [569506311] [2025-03-03 18:41:34,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:41:34,959 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 18:41:34,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 18:41:34,962 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 18:41:34,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 18:41:35,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 18:41:35,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 18:41:35,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:41:35,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:41:35,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 18:41:35,086 INFO L279 TraceCheckSpWp]: Computing forward predicates...