./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-regression/rule60_list2.c_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-regression/rule60_list2.c_1.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 5dc0e184171498e703ccf08545f4f79d3c1c383c8c0fc13a1f35990befb669a4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 04:24:19,416 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 04:24:19,470 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 04:24:19,474 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 04:24:19,474 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 04:24:19,496 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 04:24:19,497 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 04:24:19,497 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 04:24:19,498 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 04:24:19,498 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 04:24:19,499 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 04:24:19,499 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 04:24:19,499 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 04:24:19,499 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 04:24:19,499 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 04:24:19,500 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 04:24:19,500 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 04:24:19,500 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 04:24:19,500 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 04:24:19,500 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 04:24:19,500 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 04:24:19,500 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 04:24:19,500 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 04:24:19,500 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 04:24:19,500 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 04:24:19,500 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 04:24:19,501 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 04:24:19,501 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 04:24:19,501 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 04:24:19,501 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 04:24:19,501 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 04:24:19,501 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 04:24:19,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:24:19,501 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 04:24:19,501 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 04:24:19,502 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 04:24:19,502 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 04:24:19,502 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 04:24:19,502 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 04:24:19,502 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 04:24:19,502 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 04:24:19,502 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 04:24:19,502 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 04:24:19,502 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 -> 5dc0e184171498e703ccf08545f4f79d3c1c383c8c0fc13a1f35990befb669a4 [2025-03-08 04:24:19,725 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 04:24:19,733 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 04:24:19,735 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 04:24:19,736 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 04:24:19,737 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 04:24:19,737 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/rule60_list2.c_1.i [2025-03-08 04:24:20,907 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8051791d/a422b1ac7b7b480e9bf547a1391e95a6/FLAGeff91c552 [2025-03-08 04:24:21,228 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 04:24:21,231 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/rule60_list2.c_1.i [2025-03-08 04:24:21,246 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8051791d/a422b1ac7b7b480e9bf547a1391e95a6/FLAGeff91c552 [2025-03-08 04:24:21,487 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8051791d/a422b1ac7b7b480e9bf547a1391e95a6 [2025-03-08 04:24:21,490 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 04:24:21,495 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 04:24:21,496 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 04:24:21,496 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 04:24:21,500 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 04:24:21,501 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:24:21" (1/1) ... [2025-03-08 04:24:21,501 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b205929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:24:21, skipping insertion in model container [2025-03-08 04:24:21,502 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:24:21" (1/1) ... [2025-03-08 04:24:21,522 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 04:24:21,624 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/rule60_list2.c_1.i[296,309] [2025-03-08 04:24:21,720 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:24:21,728 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 04:24:21,736 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/ldv-regression/rule60_list2.c_1.i[296,309] [2025-03-08 04:24:21,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:24:21,792 INFO L204 MainTranslator]: Completed translation [2025-03-08 04:24:21,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:24:21 WrapperNode [2025-03-08 04:24:21,794 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 04:24:21,795 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 04:24:21,795 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 04:24:21,795 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 04:24:21,800 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:24:21" (1/1) ... [2025-03-08 04:24:21,811 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:24:21" (1/1) ... [2025-03-08 04:24:21,829 INFO L138 Inliner]: procedures = 126, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 55 [2025-03-08 04:24:21,830 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 04:24:21,831 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 04:24:21,832 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 04:24:21,832 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 04:24:21,837 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:24:21" (1/1) ... [2025-03-08 04:24:21,837 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:24:21" (1/1) ... [2025-03-08 04:24:21,839 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:24:21" (1/1) ... [2025-03-08 04:24:21,848 INFO L175 MemorySlicer]: Split 4 memory accesses to 3 slices as follows [2, 2, 0]. 50 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2, 0]. The 0 writes are split as follows [0, 0, 0]. [2025-03-08 04:24:21,849 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:24:21" (1/1) ... [2025-03-08 04:24:21,849 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:24:21" (1/1) ... [2025-03-08 04:24:21,859 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:24:21" (1/1) ... [2025-03-08 04:24:21,860 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:24:21" (1/1) ... [2025-03-08 04:24:21,860 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:24:21" (1/1) ... [2025-03-08 04:24:21,861 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:24:21" (1/1) ... [2025-03-08 04:24:21,866 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 04:24:21,869 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 04:24:21,870 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 04:24:21,870 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 04:24:21,871 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:24:21" (1/1) ... [2025-03-08 04:24:21,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:24:21,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:24:21,902 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 04:24:21,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 04:24:21,934 INFO L130 BoogieDeclarations]: Found specification of procedure my_malloc [2025-03-08 04:24:21,934 INFO L138 BoogieDeclarations]: Found implementation of procedure my_malloc [2025-03-08 04:24:21,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 04:24:21,934 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2025-03-08 04:24:21,934 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2025-03-08 04:24:21,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 04:24:21,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 04:24:21,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 04:24:21,934 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2025-03-08 04:24:21,934 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2025-03-08 04:24:21,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 04:24:21,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 04:24:21,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 04:24:21,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 04:24:21,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 04:24:22,045 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 04:24:22,047 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 04:24:22,115 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L529: havoc #t~ret8#1.base, #t~ret8#1.offset; [2025-03-08 04:24:22,207 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-08 04:24:22,207 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 04:24:22,218 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 04:24:22,218 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 04:24:22,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:24:22 BoogieIcfgContainer [2025-03-08 04:24:22,219 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 04:24:22,221 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 04:24:22,221 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 04:24:22,225 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 04:24:22,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:24:21" (1/3) ... [2025-03-08 04:24:22,227 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70fe6791 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:24:22, skipping insertion in model container [2025-03-08 04:24:22,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:24:21" (2/3) ... [2025-03-08 04:24:22,228 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70fe6791 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:24:22, skipping insertion in model container [2025-03-08 04:24:22,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:24:22" (3/3) ... [2025-03-08 04:24:22,229 INFO L128 eAbstractionObserver]: Analyzing ICFG rule60_list2.c_1.i [2025-03-08 04:24:22,242 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 04:24:22,244 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rule60_list2.c_1.i that has 4 procedures, 37 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-08 04:24:22,298 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 04:24:22,309 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;@7ce9af33, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 04:24:22,309 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 04:24:22,313 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 28 states have internal predecessors, (31), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 04:24:22,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 04:24:22,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:24:22,318 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:24:22,319 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:24:22,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:24:22,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1786922780, now seen corresponding path program 1 times [2025-03-08 04:24:22,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:24:22,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582688343] [2025-03-08 04:24:22,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:24:22,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:24:22,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 04:24:22,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 04:24:22,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:24:22,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:24:22,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:24:22,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:24:22,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582688343] [2025-03-08 04:24:22,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582688343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:24:22,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:24:22,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 04:24:22,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230129300] [2025-03-08 04:24:22,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:24:22,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 04:24:22,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:24:22,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 04:24:22,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 04:24:22,561 INFO L87 Difference]: Start difference. First operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 28 states have internal predecessors, (31), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:24:22,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:24:22,615 INFO L93 Difference]: Finished difference Result 68 states and 93 transitions. [2025-03-08 04:24:22,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 04:24:22,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-08 04:24:22,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:24:22,621 INFO L225 Difference]: With dead ends: 68 [2025-03-08 04:24:22,621 INFO L226 Difference]: Without dead ends: 30 [2025-03-08 04:24:22,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:24:22,625 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 7 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:24:22,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 103 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:24:22,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-08 04:24:22,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-08 04:24:22,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 04:24:22,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2025-03-08 04:24:22,654 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 7 [2025-03-08 04:24:22,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:24:22,655 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2025-03-08 04:24:22,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:24:22,655 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2025-03-08 04:24:22,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 04:24:22,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:24:22,657 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:24:22,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 04:24:22,657 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:24:22,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:24:22,658 INFO L85 PathProgramCache]: Analyzing trace with hash 303788984, now seen corresponding path program 1 times [2025-03-08 04:24:22,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:24:22,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992987100] [2025-03-08 04:24:22,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:24:22,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:24:22,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 04:24:22,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 04:24:22,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:24:22,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:24:22,883 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 04:24:22,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:24:22,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992987100] [2025-03-08 04:24:22,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992987100] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:24:22,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846096174] [2025-03-08 04:24:22,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:24:22,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:24:22,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:24:22,889 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:24:22,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 04:24:22,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 04:24:23,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 04:24:23,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:24:23,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:24:23,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 04:24:23,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:24:23,088 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 04:24:23,089 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:24:23,199 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 04:24:23,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846096174] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:24:23,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:24:23,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-03-08 04:24:23,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663779535] [2025-03-08 04:24:23,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:24:23,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 04:24:23,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:24:23,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 04:24:23,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 04:24:23,201 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 04:24:23,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:24:23,227 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2025-03-08 04:24:23,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 04:24:23,228 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2025-03-08 04:24:23,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:24:23,229 INFO L225 Difference]: With dead ends: 53 [2025-03-08 04:24:23,229 INFO L226 Difference]: Without dead ends: 33 [2025-03-08 04:24:23,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 04:24:23,230 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:24:23,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:24:23,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-08 04:24:23,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-03-08 04:24:23,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-08 04:24:23,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2025-03-08 04:24:23,242 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 26 [2025-03-08 04:24:23,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:24:23,243 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2025-03-08 04:24:23,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 04:24:23,243 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2025-03-08 04:24:23,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 04:24:23,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:24:23,243 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:24:23,251 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-08 04:24:23,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:24:23,444 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:24:23,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:24:23,445 INFO L85 PathProgramCache]: Analyzing trace with hash -513859466, now seen corresponding path program 1 times [2025-03-08 04:24:23,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:24:23,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874969212] [2025-03-08 04:24:23,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:24:23,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:24:23,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 04:24:23,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 04:24:23,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:24:23,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:24:23,583 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 04:24:23,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:24:23,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874969212] [2025-03-08 04:24:23,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874969212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:24:23,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:24:23,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 04:24:23,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253066159] [2025-03-08 04:24:23,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:24:23,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 04:24:23,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:24:23,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 04:24:23,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 04:24:23,586 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 04:24:23,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:24:23,606 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2025-03-08 04:24:23,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 04:24:23,607 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2025-03-08 04:24:23,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:24:23,608 INFO L225 Difference]: With dead ends: 51 [2025-03-08 04:24:23,608 INFO L226 Difference]: Without dead ends: 30 [2025-03-08 04:24:23,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 04:24:23,609 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:24:23,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 163 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:24:23,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-08 04:24:23,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-08 04:24:23,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 04:24:23,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2025-03-08 04:24:23,615 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 26 [2025-03-08 04:24:23,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:24:23,615 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2025-03-08 04:24:23,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 04:24:23,615 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2025-03-08 04:24:23,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 04:24:23,616 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:24:23,616 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:24:23,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 04:24:23,616 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:24:23,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:24:23,617 INFO L85 PathProgramCache]: Analyzing trace with hash 187205112, now seen corresponding path program 1 times [2025-03-08 04:24:23,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:24:23,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586486820] [2025-03-08 04:24:23,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:24:23,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:24:23,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 04:24:23,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 04:24:23,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:24:23,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:24:23,892 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:24:23,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:24:23,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586486820] [2025-03-08 04:24:23,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586486820] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:24:23,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324166473] [2025-03-08 04:24:23,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:24:23,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:24:23,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:24:23,895 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:24:23,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 04:24:23,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 04:24:23,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 04:24:23,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:24:23,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:24:23,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 04:24:23,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:24:24,281 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 04:24:24,281 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 04:24:24,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324166473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:24:24,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 04:24:24,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13] total 23 [2025-03-08 04:24:24,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938387846] [2025-03-08 04:24:24,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:24:24,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 04:24:24,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:24:24,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 04:24:24,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2025-03-08 04:24:24,284 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 04:24:24,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:24:24,580 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2025-03-08 04:24:24,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 04:24:24,580 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2025-03-08 04:24:24,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:24:24,581 INFO L225 Difference]: With dead ends: 57 [2025-03-08 04:24:24,581 INFO L226 Difference]: Without dead ends: 54 [2025-03-08 04:24:24,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=907, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 04:24:24,582 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 50 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 04:24:24,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 120 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 04:24:24,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-08 04:24:24,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 48. [2025-03-08 04:24:24,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 34 states have internal predecessors, (40), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2025-03-08 04:24:24,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2025-03-08 04:24:24,589 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 26 [2025-03-08 04:24:24,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:24:24,589 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2025-03-08 04:24:24,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 04:24:24,589 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2025-03-08 04:24:24,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 04:24:24,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:24:24,593 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:24:24,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 04:24:24,796 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,SelfDestructingSolverStorable3 [2025-03-08 04:24:24,797 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:24:24,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:24:24,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1614044748, now seen corresponding path program 1 times [2025-03-08 04:24:24,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:24:24,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649654546] [2025-03-08 04:24:24,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:24:24,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:24:24,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 04:24:24,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 04:24:24,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:24:24,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:24:25,046 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:24:25,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:24:25,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649654546] [2025-03-08 04:24:25,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649654546] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:24:25,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284136124] [2025-03-08 04:24:25,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:24:25,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:24:25,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:24:25,049 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:24:25,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 04:24:25,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 04:24:25,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 04:24:25,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:24:25,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:24:25,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 04:24:25,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:24:25,237 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:24:25,238 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:24:25,459 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:24:25,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284136124] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:24:25,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:24:25,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 21 [2025-03-08 04:24:25,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885957453] [2025-03-08 04:24:25,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:24:25,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 04:24:25,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:24:25,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 04:24:25,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2025-03-08 04:24:25,460 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand has 21 states, 19 states have (on average 1.736842105263158) internal successors, (33), 17 states have internal predecessors, (33), 5 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 04:24:25,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:24:25,840 INFO L93 Difference]: Finished difference Result 64 states and 80 transitions. [2025-03-08 04:24:25,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 04:24:25,842 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 1.736842105263158) internal successors, (33), 17 states have internal predecessors, (33), 5 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 33 [2025-03-08 04:24:25,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:24:25,842 INFO L225 Difference]: With dead ends: 64 [2025-03-08 04:24:25,842 INFO L226 Difference]: Without dead ends: 60 [2025-03-08 04:24:25,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 47 SyntacticMatches, 15 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=815, Unknown=0, NotChecked=0, Total=930 [2025-03-08 04:24:25,844 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 46 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 04:24:25,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 133 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 04:24:25,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-08 04:24:25,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2025-03-08 04:24:25,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 39 states have (on average 1.205128205128205) internal successors, (47), 41 states have internal predecessors, (47), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2025-03-08 04:24:25,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2025-03-08 04:24:25,855 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 33 [2025-03-08 04:24:25,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:24:25,855 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2025-03-08 04:24:25,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 1.736842105263158) internal successors, (33), 17 states have internal predecessors, (33), 5 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 04:24:25,855 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2025-03-08 04:24:25,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 04:24:25,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:24:25,856 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:24:25,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 04:24:26,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:24:26,056 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:24:26,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:24:26,057 INFO L85 PathProgramCache]: Analyzing trace with hash -938112213, now seen corresponding path program 1 times [2025-03-08 04:24:26,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:24:26,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297721925] [2025-03-08 04:24:26,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:24:26,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:24:26,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 04:24:26,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 04:24:26,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:24:26,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:24:26,239 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:24:26,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:24:26,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297721925] [2025-03-08 04:24:26,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297721925] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:24:26,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959453914] [2025-03-08 04:24:26,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:24:26,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:24:26,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:24:26,242 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:24:26,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 04:24:26,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 04:24:26,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 04:24:26,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:24:26,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:24:26,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 04:24:26,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:24:26,528 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:24:26,529 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:24:26,787 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:24:26,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959453914] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:24:26,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:24:26,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 32 [2025-03-08 04:24:26,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875483905] [2025-03-08 04:24:26,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:24:26,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-08 04:24:26,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:24:26,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-08 04:24:26,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=879, Unknown=0, NotChecked=0, Total=992 [2025-03-08 04:24:26,790 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 32 states, 32 states have (on average 1.9375) internal successors, (62), 26 states have internal predecessors, (62), 7 states have call successors, (13), 11 states have call predecessors, (13), 7 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-03-08 04:24:27,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:24:27,503 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2025-03-08 04:24:27,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 04:24:27,504 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.9375) internal successors, (62), 26 states have internal predecessors, (62), 7 states have call successors, (13), 11 states have call predecessors, (13), 7 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) Word has length 33 [2025-03-08 04:24:27,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:24:27,505 INFO L225 Difference]: With dead ends: 74 [2025-03-08 04:24:27,505 INFO L226 Difference]: Without dead ends: 64 [2025-03-08 04:24:27,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=279, Invalid=1701, Unknown=0, NotChecked=0, Total=1980 [2025-03-08 04:24:27,507 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 111 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 1025 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 04:24:27,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 186 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1025 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 04:24:27,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-08 04:24:27,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 49. [2025-03-08 04:24:27,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 36 states have internal predecessors, (40), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-08 04:24:27,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2025-03-08 04:24:27,514 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 33 [2025-03-08 04:24:27,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:24:27,514 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2025-03-08 04:24:27,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.9375) internal successors, (62), 26 states have internal predecessors, (62), 7 states have call successors, (13), 11 states have call predecessors, (13), 7 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-03-08 04:24:27,514 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2025-03-08 04:24:27,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 04:24:27,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:24:27,515 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:24:27,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 04:24:27,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:24:27,716 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:24:27,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:24:27,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1257828861, now seen corresponding path program 1 times [2025-03-08 04:24:27,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:24:27,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523446761] [2025-03-08 04:24:27,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:24:27,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:24:27,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 04:24:27,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 04:24:27,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:24:27,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:24:27,893 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 04:24:27,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:24:27,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523446761] [2025-03-08 04:24:27,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523446761] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:24:27,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355415007] [2025-03-08 04:24:27,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:24:27,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:24:27,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:24:27,898 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:24:27,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 04:24:27,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 04:24:27,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 04:24:27,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:24:27,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:24:27,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 04:24:27,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:24:28,282 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 04:24:28,282 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:24:28,591 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 04:24:28,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355415007] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:24:28,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:24:28,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 35 [2025-03-08 04:24:28,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746394236] [2025-03-08 04:24:28,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:24:28,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-08 04:24:28,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:24:28,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-08 04:24:28,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1112, Unknown=0, NotChecked=0, Total=1190 [2025-03-08 04:24:28,593 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 35 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 28 states have internal predecessors, (58), 8 states have call successors, (10), 6 states have call predecessors, (10), 8 states have return successors, (9), 8 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-08 04:24:29,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:24:29,494 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2025-03-08 04:24:29,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 04:24:29,495 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 28 states have internal predecessors, (58), 8 states have call successors, (10), 6 states have call predecessors, (10), 8 states have return successors, (9), 8 states have call predecessors, (9), 5 states have call successors, (9) Word has length 43 [2025-03-08 04:24:29,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:24:29,496 INFO L225 Difference]: With dead ends: 89 [2025-03-08 04:24:29,496 INFO L226 Difference]: Without dead ends: 71 [2025-03-08 04:24:29,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 63 SyntacticMatches, 13 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=307, Invalid=2999, Unknown=0, NotChecked=0, Total=3306 [2025-03-08 04:24:29,497 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 79 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 1458 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 1513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 04:24:29,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 263 Invalid, 1513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1458 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 04:24:29,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-08 04:24:29,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 62. [2025-03-08 04:24:29,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 45 states have internal predecessors, (51), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (9), 8 states have call predecessors, (9), 7 states have call successors, (9) [2025-03-08 04:24:29,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2025-03-08 04:24:29,506 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 43 [2025-03-08 04:24:29,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:24:29,506 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2025-03-08 04:24:29,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 28 states have internal predecessors, (58), 8 states have call successors, (10), 6 states have call predecessors, (10), 8 states have return successors, (9), 8 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-08 04:24:29,507 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2025-03-08 04:24:29,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 04:24:29,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:24:29,508 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:24:29,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 04:24:29,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:24:29,708 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:24:29,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:24:29,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1426626179, now seen corresponding path program 1 times [2025-03-08 04:24:29,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:24:29,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651781145] [2025-03-08 04:24:29,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:24:29,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:24:29,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 04:24:29,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 04:24:29,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:24:29,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:24:29,919 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 04:24:29,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:24:29,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651781145] [2025-03-08 04:24:29,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651781145] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:24:29,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885777507] [2025-03-08 04:24:29,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:24:29,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:24:29,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:24:29,923 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:24:29,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 04:24:29,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 04:24:29,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 04:24:29,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:24:29,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:24:29,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 04:24:29,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:24:30,113 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 04:24:30,117 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 04:24:30,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885777507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:24:30,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 04:24:30,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [15] total 22 [2025-03-08 04:24:30,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858460409] [2025-03-08 04:24:30,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:24:30,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 04:24:30,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:24:30,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 04:24:30,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2025-03-08 04:24:30,119 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 04:24:30,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:24:30,303 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2025-03-08 04:24:30,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 04:24:30,303 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 43 [2025-03-08 04:24:30,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:24:30,304 INFO L225 Difference]: With dead ends: 74 [2025-03-08 04:24:30,304 INFO L226 Difference]: Without dead ends: 67 [2025-03-08 04:24:30,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=847, Unknown=0, NotChecked=0, Total=992 [2025-03-08 04:24:30,305 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 42 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:24:30,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 95 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:24:30,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-08 04:24:30,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2025-03-08 04:24:30,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 38 states have internal predecessors, (43), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-08 04:24:30,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2025-03-08 04:24:30,310 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 43 [2025-03-08 04:24:30,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:24:30,310 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2025-03-08 04:24:30,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 04:24:30,311 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2025-03-08 04:24:30,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 04:24:30,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:24:30,311 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:24:30,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 04:24:30,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:24:30,512 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:24:30,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:24:30,512 INFO L85 PathProgramCache]: Analyzing trace with hash 495828742, now seen corresponding path program 1 times [2025-03-08 04:24:30,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:24:30,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908235463] [2025-03-08 04:24:30,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:24:30,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:24:30,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 04:24:30,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 04:24:30,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:24:30,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 04:24:30,530 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 04:24:30,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 04:24:30,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 04:24:30,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:24:30,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 04:24:30,557 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 04:24:30,557 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 04:24:30,558 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 04:24:30,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 04:24:30,563 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:24:30,602 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 04:24:30,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 04:24:30 BoogieIcfgContainer [2025-03-08 04:24:30,605 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 04:24:30,606 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 04:24:30,606 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 04:24:30,606 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 04:24:30,606 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:24:22" (3/4) ... [2025-03-08 04:24:30,607 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-08 04:24:30,656 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 26. [2025-03-08 04:24:30,704 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 04:24:30,704 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 04:24:30,704 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 04:24:30,705 INFO L158 Benchmark]: Toolchain (without parser) took 9210.48ms. Allocated memory is still 167.8MB. Free memory was 121.4MB in the beginning and 52.6MB in the end (delta: 68.8MB). Peak memory consumption was 69.4MB. Max. memory is 16.1GB. [2025-03-08 04:24:30,705 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 04:24:30,706 INFO L158 Benchmark]: CACSL2BoogieTranslator took 298.65ms. Allocated memory is still 167.8MB. Free memory was 120.9MB in the beginning and 103.7MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 04:24:30,707 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.38ms. Allocated memory is still 167.8MB. Free memory was 103.7MB in the beginning and 102.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 04:24:30,707 INFO L158 Benchmark]: Boogie Preprocessor took 37.78ms. Allocated memory is still 167.8MB. Free memory was 102.4MB in the beginning and 101.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 04:24:30,707 INFO L158 Benchmark]: IcfgBuilder took 349.89ms. Allocated memory is still 167.8MB. Free memory was 100.5MB in the beginning and 87.4MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 04:24:30,707 INFO L158 Benchmark]: TraceAbstraction took 8384.34ms. Allocated memory is still 167.8MB. Free memory was 86.9MB in the beginning and 61.0MB in the end (delta: 25.9MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. [2025-03-08 04:24:30,708 INFO L158 Benchmark]: Witness Printer took 98.46ms. Allocated memory is still 167.8MB. Free memory was 61.0MB in the beginning and 52.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 04:24:30,709 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 298.65ms. Allocated memory is still 167.8MB. Free memory was 120.9MB in the beginning and 103.7MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.38ms. Allocated memory is still 167.8MB. Free memory was 103.7MB in the beginning and 102.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.78ms. Allocated memory is still 167.8MB. Free memory was 102.4MB in the beginning and 101.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 349.89ms. Allocated memory is still 167.8MB. Free memory was 100.5MB in the beginning and 87.4MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8384.34ms. Allocated memory is still 167.8MB. Free memory was 86.9MB in the beginning and 61.0MB in the end (delta: 25.9MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. * Witness Printer took 98.46ms. Allocated memory is still 167.8MB. Free memory was 61.0MB in the beginning and 52.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. 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 - CounterExampleResult [Line: 6]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L519] void * guard_malloc_counter = 0; [L534] struct list_head *elem = ((void *)0); [L544] static struct list_head head; [L544] static struct list_head head; [L544] static struct list_head head; VAL [elem={0:0}, guard_malloc_counter={0:0}, head={4:0}] [L546] struct list_head *dev1, *dev2; VAL [elem={0:0}, guard_malloc_counter={0:0}, head={4:0}] [L547] CALL, EXPR my_malloc(sizeof(*dev1)) VAL [elem={0:0}, guard_malloc_counter={0:0}, head={4:0}] [L529] CALL, EXPR __getMemory(size) [L522] (size > 0) ? (0) : __blast_assert () VAL [elem={0:0}, guard_malloc_counter={0:0}, head={4:0}] [L523] guard_malloc_counter++ [L524] COND FALSE !(!__VERIFIER_nondet_int()) [L526] return (void *) guard_malloc_counter; VAL [\result={0:1}, elem={0:0}, guard_malloc_counter={0:1}, head={4:0}] [L529] RET, EXPR __getMemory(size) [L529] return __getMemory(size); [L547] RET, EXPR my_malloc(sizeof(*dev1)) VAL [elem={0:0}, guard_malloc_counter={0:1}, head={4:0}] [L547] dev1 = my_malloc(sizeof(*dev1)) [L548] CALL, EXPR my_malloc(sizeof(*dev2)) VAL [elem={0:0}, guard_malloc_counter={0:1}, head={4:0}] [L529] CALL, EXPR __getMemory(size) [L522] (size > 0) ? (0) : __blast_assert () VAL [elem={0:0}, guard_malloc_counter={0:1}, head={4:0}] [L523] guard_malloc_counter++ [L524] COND FALSE !(!__VERIFIER_nondet_int()) [L526] return (void *) guard_malloc_counter; VAL [\result={0:2}, elem={0:0}, guard_malloc_counter={0:2}, head={4:0}] [L529] RET, EXPR __getMemory(size) [L529] return __getMemory(size); [L548] RET, EXPR my_malloc(sizeof(*dev2)) VAL [dev1={0:1}, elem={0:0}, guard_malloc_counter={0:2}, head={4:0}] [L548] dev2 = my_malloc(sizeof(*dev2)) [L549] COND TRUE dev1!=((void *)0) && dev2!=((void *)0) VAL [dev1={0:1}, dev2={0:2}, elem={0:0}, guard_malloc_counter={0:2}, head={4:0}] [L550] CALL list_add(dev2, &head) VAL [\old(head)={4:0}, \old(new)={0:2}, elem={0:0}, guard_malloc_counter={0:2}, head={4:0}] [L536] (new!=elem) ? (0) : __blast_assert () VAL [\old(head)={4:0}, \old(new)={0:2}, elem={0:0}, guard_malloc_counter={0:2}, head={4:0}, new={0:2}] [L537] COND TRUE __VERIFIER_nondet_int() [L538] elem = new VAL [\old(head)={4:0}, \old(new)={0:2}, elem={0:2}, guard_malloc_counter={0:2}, head={4:0}] [L550] RET list_add(dev2, &head) VAL [dev1={0:1}, dev2={0:2}, elem={0:2}, guard_malloc_counter={0:2}, head={4:0}] [L551] CALL list_add(dev1, &head) VAL [\old(head)={4:0}, \old(new)={0:1}, elem={0:2}, guard_malloc_counter={0:2}, head={4:0}] [L536] (new!=elem) ? (0) : __blast_assert () VAL [\old(head)={4:0}, \old(new)={0:1}, elem={0:2}, guard_malloc_counter={0:2}, head={4:0}, new={0:1}] [L537] COND TRUE __VERIFIER_nondet_int() [L538] elem = new VAL [\old(head)={4:0}, \old(new)={0:1}, elem={0:1}, guard_malloc_counter={0:2}, head={4:0}] [L551] RET list_add(dev1, &head) VAL [dev1={0:1}, dev2={0:2}, elem={0:1}, guard_malloc_counter={0:2}, head={4:0}] [L552] CALL list_del(dev2) [L541] COND FALSE !(entry==elem) VAL [elem={0:1}, guard_malloc_counter={0:2}, head={4:0}] [L552] RET list_del(dev2) [L553] CALL list_add(dev2, &head) VAL [\old(head)={4:0}, \old(new)={0:2}, elem={0:1}, guard_malloc_counter={0:2}, head={4:0}] [L536] (new!=elem) ? (0) : __blast_assert () VAL [\old(head)={4:0}, \old(new)={0:2}, elem={0:1}, guard_malloc_counter={0:2}, head={4:0}, new={0:2}] [L537] COND FALSE !(__VERIFIER_nondet_int()) [L553] RET list_add(dev2, &head) VAL [dev1={0:1}, dev2={0:2}, elem={0:1}, guard_malloc_counter={0:2}, head={4:0}] [L554] CALL list_add(dev1, &head) VAL [\old(head)={4:0}, \old(new)={0:1}, elem={0:1}, guard_malloc_counter={0:2}, head={4:0}] [L536] (new!=elem) ? (0) : __blast_assert () VAL [\old(head)={4:0}, \old(new)={0:1}, elem={0:1}, guard_malloc_counter={0:2}, head={4:0}, new={0:1}] [L536] CALL __blast_assert () VAL [elem={0:1}, guard_malloc_counter={0:2}, head={4:0}] [L6] reach_error() VAL [elem={0:1}, guard_malloc_counter={0:2}, head={4:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 37 locations, 55 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.3s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 338 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 335 mSDsluCounter, 1235 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1034 mSDsCounter, 186 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3561 IncrementalHoareTripleChecker+Invalid, 3747 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 186 mSolverCounterUnsat, 201 mSDtfsCounter, 3561 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 497 GetRequests, 268 SyntacticMatches, 29 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1190 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=7, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 48 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 491 NumberOfCodeBlocks, 491 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 558 ConstructedInterpolants, 0 QuantifiedInterpolants, 2006 SizeOfPredicates, 23 NumberOfNonLiveVariables, 1199 ConjunctsInSsa, 105 ConjunctsInUnsatCore, 18 InterpolantComputations, 4 PerfectInterpolantSequences, 115/181 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 proved your program to be incorrect! [2025-03-08 04:24:30,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE