./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-manipulation/tree-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/heap-manipulation/tree-4.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 93cf6e13715dcd5309cb599b4358d41a64464f02c52b3716bc554a9d0e833f5e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 04:27:45,630 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 04:27:45,681 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 04:27:45,686 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 04:27:45,689 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 04:27:45,708 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 04:27:45,709 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 04:27:45,709 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 04:27:45,709 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 04:27:45,710 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 04:27:45,710 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 04:27:45,710 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 04:27:45,711 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 04:27:45,711 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 04:27:45,711 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 04:27:45,712 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 04:27:45,712 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 04:27:45,712 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 04:27:45,712 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 04:27:45,712 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 04:27:45,712 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 04:27:45,712 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 04:27:45,712 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 04:27:45,712 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 04:27:45,712 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 04:27:45,712 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 04:27:45,713 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 04:27:45,713 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 04:27:45,713 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 04:27:45,713 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 04:27:45,713 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 04:27:45,713 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 04:27:45,713 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:27:45,713 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 04:27:45,714 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 04:27:45,714 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 04:27:45,714 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 04:27:45,714 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 04:27:45,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 04:27:45,714 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 04:27:45,714 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 04:27:45,714 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 04:27:45,714 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 04:27:45,714 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 -> 93cf6e13715dcd5309cb599b4358d41a64464f02c52b3716bc554a9d0e833f5e [2025-03-08 04:27:45,932 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 04:27:45,940 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 04:27:45,942 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 04:27:45,943 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 04:27:45,943 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 04:27:45,944 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/tree-4.i [2025-03-08 04:27:47,068 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/559bff08a/400d4f4f8e2c4f00be5da3f2a0954568/FLAG706765966 [2025-03-08 04:27:47,325 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 04:27:47,327 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/tree-4.i [2025-03-08 04:27:47,341 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/559bff08a/400d4f4f8e2c4f00be5da3f2a0954568/FLAG706765966 [2025-03-08 04:27:47,629 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/559bff08a/400d4f4f8e2c4f00be5da3f2a0954568 [2025-03-08 04:27:47,631 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 04:27:47,632 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 04:27:47,633 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 04:27:47,633 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 04:27:47,636 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 04:27:47,636 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:27:47" (1/1) ... [2025-03-08 04:27:47,637 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3aeeef48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:27:47, skipping insertion in model container [2025-03-08 04:27:47,637 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:27:47" (1/1) ... [2025-03-08 04:27:47,652 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 04:27:47,833 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/heap-manipulation/tree-4.i[22626,22639] [2025-03-08 04:27:47,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:27:47,854 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 04:27:47,875 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/heap-manipulation/tree-4.i[22626,22639] [2025-03-08 04:27:47,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:27:47,898 INFO L204 MainTranslator]: Completed translation [2025-03-08 04:27:47,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:27:47 WrapperNode [2025-03-08 04:27:47,898 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 04:27:47,899 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 04:27:47,899 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 04:27:47,899 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 04:27:47,903 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:27:47" (1/1) ... [2025-03-08 04:27:47,910 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:27:47" (1/1) ... [2025-03-08 04:27:47,928 INFO L138 Inliner]: procedures = 122, calls = 44, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2025-03-08 04:27:47,929 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 04:27:47,929 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 04:27:47,929 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 04:27:47,929 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 04:27:47,935 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:27:47" (1/1) ... [2025-03-08 04:27:47,936 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:27:47" (1/1) ... [2025-03-08 04:27:47,937 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:27:47" (1/1) ... [2025-03-08 04:27:47,953 INFO L175 MemorySlicer]: Split 29 memory accesses to 2 slices as follows [2, 27]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 10 writes are split as follows [0, 10]. [2025-03-08 04:27:47,953 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:27:47" (1/1) ... [2025-03-08 04:27:47,953 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:27:47" (1/1) ... [2025-03-08 04:27:47,958 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:27:47" (1/1) ... [2025-03-08 04:27:47,958 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:27:47" (1/1) ... [2025-03-08 04:27:47,960 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:27:47" (1/1) ... [2025-03-08 04:27:47,963 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:27:47" (1/1) ... [2025-03-08 04:27:47,964 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 04:27:47,966 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 04:27:47,966 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 04:27:47,966 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 04:27:47,967 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:27:47" (1/1) ... [2025-03-08 04:27:47,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:27:47,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:27:47,990 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:27:47,994 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:27:48,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 04:27:48,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 04:27:48,009 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2025-03-08 04:27:48,009 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2025-03-08 04:27:48,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 04:27:48,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 04:27:48,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 04:27:48,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 04:27:48,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 04:27:48,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 04:27:48,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 04:27:48,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 04:27:48,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 04:27:48,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 04:27:48,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 04:27:48,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 04:27:48,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 04:27:48,082 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 04:27:48,084 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 04:27:48,257 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2025-03-08 04:27:48,258 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 04:27:48,264 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 04:27:48,265 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 04:27:48,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:27:48 BoogieIcfgContainer [2025-03-08 04:27:48,266 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 04:27:48,267 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 04:27:48,267 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 04:27:48,270 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 04:27:48,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:27:47" (1/3) ... [2025-03-08 04:27:48,271 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@982d0e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:27:48, skipping insertion in model container [2025-03-08 04:27:48,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:27:47" (2/3) ... [2025-03-08 04:27:48,272 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@982d0e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:27:48, skipping insertion in model container [2025-03-08 04:27:48,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:27:48" (3/3) ... [2025-03-08 04:27:48,273 INFO L128 eAbstractionObserver]: Analyzing ICFG tree-4.i [2025-03-08 04:27:48,284 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 04:27:48,285 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG tree-4.i that has 2 procedures, 44 locations, 1 initial locations, 8 loop locations, and 1 error locations. [2025-03-08 04:27:48,316 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 04:27:48,327 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;@c1cfadc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 04:27:48,327 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 04:27:48,330 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 38 states have (on average 1.6578947368421053) internal successors, (63), 42 states have internal predecessors, (63), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 04:27:48,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 04:27:48,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:27:48,334 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:27:48,335 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:27:48,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:27:48,338 INFO L85 PathProgramCache]: Analyzing trace with hash 436795548, now seen corresponding path program 1 times [2025-03-08 04:27:48,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:27:48,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736199111] [2025-03-08 04:27:48,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:27:48,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:27:48,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 04:27:48,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 04:27:48,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:27:48,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:27:48,438 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:27:48,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:27:48,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736199111] [2025-03-08 04:27:48,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736199111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:27:48,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:27:48,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 04:27:48,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824242697] [2025-03-08 04:27:48,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:27:48,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 04:27:48,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:27:48,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 04:27:48,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 04:27:48,458 INFO L87 Difference]: Start difference. First operand has 44 states, 38 states have (on average 1.6578947368421053) internal successors, (63), 42 states have internal predecessors, (63), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:27:48,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:27:48,473 INFO L93 Difference]: Finished difference Result 84 states and 135 transitions. [2025-03-08 04:27:48,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 04:27:48,474 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-08 04:27:48,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:27:48,478 INFO L225 Difference]: With dead ends: 84 [2025-03-08 04:27:48,478 INFO L226 Difference]: Without dead ends: 30 [2025-03-08 04:27:48,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 04:27:48,483 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:27:48,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:27:48,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-08 04:27:48,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-08 04:27:48,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 28 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:27:48,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2025-03-08 04:27:48,515 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 10 [2025-03-08 04:27:48,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:27:48,515 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2025-03-08 04:27:48,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:27:48,516 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2025-03-08 04:27:48,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 04:27:48,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:27:48,517 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:27:48,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 04:27:48,518 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:27:48,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:27:48,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1382609275, now seen corresponding path program 1 times [2025-03-08 04:27:48,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:27:48,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135840197] [2025-03-08 04:27:48,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:27:48,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:27:48,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 04:27:48,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 04:27:48,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:27:48,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:27:48,630 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:27:48,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:27:48,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135840197] [2025-03-08 04:27:48,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135840197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:27:48,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:27:48,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 04:27:48,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621926463] [2025-03-08 04:27:48,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:27:48,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 04:27:48,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:27:48,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 04:27:48,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:27:48,632 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:27:48,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:27:48,681 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2025-03-08 04:27:48,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 04:27:48,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-08 04:27:48,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:27:48,683 INFO L225 Difference]: With dead ends: 55 [2025-03-08 04:27:48,684 INFO L226 Difference]: Without dead ends: 34 [2025-03-08 04:27:48,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:27:48,684 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:27:48,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 59 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:27:48,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-08 04:27:48,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-03-08 04:27:48,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 32 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:27:48,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2025-03-08 04:27:48,688 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 11 [2025-03-08 04:27:48,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:27:48,688 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2025-03-08 04:27:48,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:27:48,689 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2025-03-08 04:27:48,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 04:27:48,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:27:48,689 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:27:48,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 04:27:48,689 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:27:48,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:27:48,690 INFO L85 PathProgramCache]: Analyzing trace with hash -495105594, now seen corresponding path program 1 times [2025-03-08 04:27:48,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:27:48,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170199302] [2025-03-08 04:27:48,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:27:48,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:27:48,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 04:27:48,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 04:27:48,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:27:48,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:27:48,822 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:27:48,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:27:48,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170199302] [2025-03-08 04:27:48,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170199302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:27:48,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:27:48,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 04:27:48,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494384177] [2025-03-08 04:27:48,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:27:48,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 04:27:48,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:27:48,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 04:27:48,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:27:48,825 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:27:48,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:27:48,858 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2025-03-08 04:27:48,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 04:27:48,859 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-08 04:27:48,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:27:48,859 INFO L225 Difference]: With dead ends: 69 [2025-03-08 04:27:48,859 INFO L226 Difference]: Without dead ends: 36 [2025-03-08 04:27:48,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:27:48,860 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 3 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:27:48,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 126 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:27:48,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-08 04:27:48,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-08 04:27:48,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.25) internal successors, (40), 34 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:27:48,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2025-03-08 04:27:48,863 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 11 [2025-03-08 04:27:48,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:27:48,863 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2025-03-08 04:27:48,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:27:48,863 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2025-03-08 04:27:48,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 04:27:48,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:27:48,864 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:27:48,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 04:27:48,864 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:27:48,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:27:48,864 INFO L85 PathProgramCache]: Analyzing trace with hash -378813622, now seen corresponding path program 1 times [2025-03-08 04:27:48,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:27:48,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273519602] [2025-03-08 04:27:48,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:27:48,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:27:48,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 04:27:48,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 04:27:48,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:27:48,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:27:48,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:27:48,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:27:48,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273519602] [2025-03-08 04:27:48,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273519602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:27:48,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:27:48,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 04:27:48,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86460493] [2025-03-08 04:27:48,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:27:48,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 04:27:48,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:27:48,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 04:27:48,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:27:48,929 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:27:48,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:27:48,971 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2025-03-08 04:27:48,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 04:27:48,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-08 04:27:48,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:27:48,971 INFO L225 Difference]: With dead ends: 57 [2025-03-08 04:27:48,971 INFO L226 Difference]: Without dead ends: 38 [2025-03-08 04:27:48,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:27:48,972 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 3 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:27:48,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 52 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:27:48,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-08 04:27:48,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2025-03-08 04:27:48,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.21875) internal successors, (39), 34 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:27:48,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2025-03-08 04:27:48,975 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 17 [2025-03-08 04:27:48,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:27:48,976 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2025-03-08 04:27:48,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:27:48,976 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2025-03-08 04:27:48,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 04:27:48,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:27:48,976 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:27:48,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 04:27:48,976 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:27:48,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:27:48,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1356308705, now seen corresponding path program 1 times [2025-03-08 04:27:48,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:27:48,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553661428] [2025-03-08 04:27:48,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:27:48,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:27:48,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 04:27:49,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 04:27:49,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:27:49,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:27:49,130 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 04:27:49,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:27:49,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553661428] [2025-03-08 04:27:49,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553661428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:27:49,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:27:49,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 04:27:49,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969830612] [2025-03-08 04:27:49,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:27:49,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 04:27:49,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:27:49,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 04:27:49,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 04:27:49,132 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:27:49,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:27:49,280 INFO L93 Difference]: Finished difference Result 77 states and 92 transitions. [2025-03-08 04:27:49,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 04:27:49,280 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-08 04:27:49,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:27:49,281 INFO L225 Difference]: With dead ends: 77 [2025-03-08 04:27:49,281 INFO L226 Difference]: Without dead ends: 48 [2025-03-08 04:27:49,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 04:27:49,282 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 50 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:27:49,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 97 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:27:49,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-08 04:27:49,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 35. [2025-03-08 04:27:49,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 32 states have (on average 1.15625) internal successors, (37), 33 states have internal predecessors, (37), 2 states have call successors, (2), 1 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:27:49,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2025-03-08 04:27:49,288 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 20 [2025-03-08 04:27:49,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:27:49,289 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2025-03-08 04:27:49,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:27:49,289 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2025-03-08 04:27:49,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 04:27:49,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:27:49,289 INFO L218 NwaCegarLoop]: trace histogram [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:27:49,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 04:27:49,289 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:27:49,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:27:49,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1442565973, now seen corresponding path program 1 times [2025-03-08 04:27:49,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:27:49,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399915263] [2025-03-08 04:27:49,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:27:49,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:27:49,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 04:27:49,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 04:27:49,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:27:49,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:27:50,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:27:50,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:27:50,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399915263] [2025-03-08 04:27:50,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399915263] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:27:50,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686816241] [2025-03-08 04:27:50,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:27:50,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:27:50,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:27:50,511 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:27:50,513 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:27:50,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 04:27:50,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 04:27:50,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:27:50,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:27:50,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-03-08 04:27:50,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:27:50,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 04:27:50,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 04:27:50,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:50,853 INFO L349 Elim1Store]: treesize reduction 391, result has 0.3 percent of original size [2025-03-08 04:27:50,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 10 new quantified variables, introduced 13 case distinctions, treesize of input 6695 treesize of output 4556 [2025-03-08 04:27:50,886 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:27:50,887 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:27:50,887 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:27:50,890 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-08 04:27:50,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:50,929 INFO L349 Elim1Store]: treesize reduction 391, result has 0.3 percent of original size [2025-03-08 04:27:50,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 10 new quantified variables, introduced 13 case distinctions, treesize of input 6635 treesize of output 4508 [2025-03-08 04:27:50,986 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:27:50,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:50,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:52,365 INFO L349 Elim1Store]: treesize reduction 116, result has 30.1 percent of original size [2025-03-08 04:27:52,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 6 case distinctions, treesize of input 6108 treesize of output 3920 [2025-03-08 04:27:52,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:52,680 INFO L349 Elim1Store]: treesize reduction 48, result has 25.0 percent of original size [2025-03-08 04:27:52,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 1640 treesize of output 1477 [2025-03-08 04:27:52,755 INFO L349 Elim1Store]: treesize reduction 121, result has 5.5 percent of original size [2025-03-08 04:27:52,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 179 [2025-03-08 04:27:52,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:52,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:52,890 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:27:52,893 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:27:52,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 17 [2025-03-08 04:27:52,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-08 04:27:53,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 58 [2025-03-08 04:27:53,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:53,107 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:27:53,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 23 [2025-03-08 04:27:53,292 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:27:53,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:53,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:53,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2025-03-08 04:27:53,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2025-03-08 04:27:53,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2025-03-08 04:27:53,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 173 [2025-03-08 04:27:53,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 163 [2025-03-08 04:27:53,495 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse10 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) 0))) (let ((.cse0 (= .cse2 0)) (.cse1 (= (select .cse10 0) 0))) (or (and (= 42 (select (select |c_#memory_int#1| 0) 12)) .cse0 .cse1) (and (or (exists ((v_DerPreprocessor_6 (Array Int Int))) (= (store (select |c_#memory_$Pointer$#1.base| 0) 4 0) (select (store (store |c_#memory_$Pointer$#1.base| 0 v_DerPreprocessor_6) .cse2 (select |c_#memory_$Pointer$#1.base| .cse2)) 0))) .cse0) (let ((.cse6 (= 42 (select (select |c_#memory_int#1| .cse2) 12)))) (or (and (exists ((v_ArrVal_216 (Array Int Int)) (v_ArrVal_215 (Array Int Int)) (v_arrayElimArr_24 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.base| .cse2 v_arrayElimArr_28) 0 v_ArrVal_215) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) 0))) (let ((.cse5 (store (store (store |c_#memory_int#1| .cse2 v_DerPreprocessor_8) 0 v_DerPreprocessor_9) .cse4 v_DerPreprocessor_10))) (and (= (select v_arrayElimArr_24 0) 0) (let ((.cse3 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_arrayElimArr_24) 0 v_ArrVal_216) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) 0) 8))) (= (select v_DerPreprocessor_10 .cse3) (select (select |c_#memory_int#1| .cse4) .cse3))) (= 42 (select (select .cse5 0) 12)) (= (select v_arrayElimArr_28 0) 0) (= v_DerPreprocessor_8 (select .cse5 .cse2)))))) .cse6 .cse1) (and .cse6 (exists ((v_ArrVal_216 (Array Int Int)) (v_ArrVal_215 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse9 (select (select (store (store |c_#memory_$Pointer$#1.base| .cse2 v_arrayElimArr_27) 0 v_ArrVal_215) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) 0))) (let ((.cse7 (store (store (store |c_#memory_int#1| .cse2 v_DerPreprocessor_8) 0 v_DerPreprocessor_9) .cse9 v_DerPreprocessor_10))) (and (= v_DerPreprocessor_8 (select .cse7 .cse2)) (let ((.cse8 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 (store .cse10 0 0)) 0 v_ArrVal_216) |c_ULTIMATE.start_create_tree_~nodelast~0#1.base|) 0) 8))) (= (select v_DerPreprocessor_10 .cse8) (select (select |c_#memory_int#1| .cse9) .cse8))) (= (select v_arrayElimArr_27 0) 0) (= 42 (select (select .cse7 0) 12)))))) .cse1))) (not (= |c_ULTIMATE.start_create_tree_~nodelast~0#1.base| .cse2)))))) (= |c_ULTIMATE.start_create_tree_~nodelast~0#1.offset| 0) (not (= |c_ULTIMATE.start_create_tree_~nodelast~0#1.base| 0))) is different from true [2025-03-08 04:27:54,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:54,381 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2025-03-08 04:27:54,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 580 treesize of output 509 [2025-03-08 04:27:54,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:54,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 260 treesize of output 228 [2025-03-08 04:27:54,416 INFO L349 Elim1Store]: treesize reduction 29, result has 32.6 percent of original size [2025-03-08 04:27:54,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 180 treesize of output 157 [2025-03-08 04:27:54,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 141 [2025-03-08 04:27:54,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 122 [2025-03-08 04:27:54,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 120 [2025-03-08 04:27:54,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 118 [2025-03-08 04:27:54,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 116 [2025-03-08 04:27:54,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 114 [2025-03-08 04:27:54,503 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-03-08 04:27:54,503 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:27:54,622 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:27:54,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 2850 treesize of output 2336 [2025-03-08 04:27:54,680 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:27:54,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 4143 treesize of output 5055 [2025-03-08 04:27:54,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 4 [2025-03-08 04:27:54,968 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:27:54,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1822 treesize of output 1823 [2025-03-08 04:27:55,604 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:27:55,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 11644 treesize of output 17204