./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.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/list-ext3-properties/dll_nullified-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 7887c90df48e0e32a16c0ae4217eb11a41b3b1af1e02493e847dc25239198c19 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 00:55:44,060 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 00:55:44,152 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 00:55:44,158 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 00:55:44,161 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 00:55:44,193 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 00:55:44,195 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 00:55:44,196 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 00:55:44,197 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 00:55:44,198 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 00:55:44,198 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 00:55:44,198 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 00:55:44,199 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 00:55:44,199 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 00:55:44,201 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 00:55:44,201 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 00:55:44,202 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 00:55:44,202 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 00:55:44,202 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 00:55:44,203 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 00:55:44,203 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 00:55:44,207 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 00:55:44,207 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 00:55:44,207 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 00:55:44,208 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 00:55:44,208 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 00:55:44,208 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 00:55:44,208 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 00:55:44,209 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 00:55:44,209 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 00:55:44,210 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 00:55:44,210 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 00:55:44,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 00:55:44,211 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 00:55:44,211 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 00:55:44,211 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 00:55:44,211 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 00:55:44,212 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 00:55:44,212 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 00:55:44,212 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 00:55:44,213 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 00:55:44,213 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 00:55:44,213 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 7887c90df48e0e32a16c0ae4217eb11a41b3b1af1e02493e847dc25239198c19 [2024-11-22 00:55:44,456 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 00:55:44,479 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 00:55:44,482 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 00:55:44,484 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 00:55:44,484 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 00:55:44,485 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i [2024-11-22 00:55:45,954 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 00:55:46,199 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 00:55:46,200 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i [2024-11-22 00:55:46,220 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4199627ae/a64d4d192b7e4066ba83af5ab16f97c2/FLAG155f63b83 [2024-11-22 00:55:46,232 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4199627ae/a64d4d192b7e4066ba83af5ab16f97c2 [2024-11-22 00:55:46,234 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 00:55:46,236 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 00:55:46,238 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 00:55:46,238 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 00:55:46,245 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 00:55:46,246 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:55:46" (1/1) ... [2024-11-22 00:55:46,247 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7eef1104 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:55:46, skipping insertion in model container [2024-11-22 00:55:46,247 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:55:46" (1/1) ... [2024-11-22 00:55:46,289 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 00:55:46,662 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/list-ext3-properties/dll_nullified-1.i[24046,24059] [2024-11-22 00:55:46,668 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 00:55:46,681 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 00:55:46,738 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/list-ext3-properties/dll_nullified-1.i[24046,24059] [2024-11-22 00:55:46,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 00:55:46,771 INFO L204 MainTranslator]: Completed translation [2024-11-22 00:55:46,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:55:46 WrapperNode [2024-11-22 00:55:46,772 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 00:55:46,773 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 00:55:46,774 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 00:55:46,774 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 00:55:46,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:55:46" (1/1) ... [2024-11-22 00:55:46,796 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:55:46" (1/1) ... [2024-11-22 00:55:46,822 INFO L138 Inliner]: procedures = 123, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 112 [2024-11-22 00:55:46,823 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 00:55:46,824 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 00:55:46,824 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 00:55:46,824 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 00:55:46,835 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:55:46" (1/1) ... [2024-11-22 00:55:46,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:55:46" (1/1) ... [2024-11-22 00:55:46,842 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:55:46" (1/1) ... [2024-11-22 00:55:46,858 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 6 writes are split as follows [0, 6]. [2024-11-22 00:55:46,858 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:55:46" (1/1) ... [2024-11-22 00:55:46,859 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:55:46" (1/1) ... [2024-11-22 00:55:46,868 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:55:46" (1/1) ... [2024-11-22 00:55:46,872 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:55:46" (1/1) ... [2024-11-22 00:55:46,874 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:55:46" (1/1) ... [2024-11-22 00:55:46,875 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:55:46" (1/1) ... [2024-11-22 00:55:46,878 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 00:55:46,879 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 00:55:46,879 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 00:55:46,879 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 00:55:46,880 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:55:46" (1/1) ... [2024-11-22 00:55:46,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 00:55:46,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:55:46,916 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) [2024-11-22 00:55:46,918 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 [2024-11-22 00:55:46,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-22 00:55:46,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-22 00:55:46,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-22 00:55:46,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-22 00:55:46,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-22 00:55:46,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 00:55:46,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-22 00:55:46,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-22 00:55:46,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-22 00:55:46,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-22 00:55:46,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 00:55:46,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 00:55:46,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-22 00:55:46,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 00:55:46,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 00:55:47,056 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 00:55:47,058 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 00:55:47,226 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-22 00:55:47,227 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 00:55:47,243 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 00:55:47,244 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-22 00:55:47,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:55:47 BoogieIcfgContainer [2024-11-22 00:55:47,245 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 00:55:47,247 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 00:55:47,248 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 00:55:47,252 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 00:55:47,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:55:46" (1/3) ... [2024-11-22 00:55:47,253 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67358fe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:55:47, skipping insertion in model container [2024-11-22 00:55:47,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:55:46" (2/3) ... [2024-11-22 00:55:47,253 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67358fe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:55:47, skipping insertion in model container [2024-11-22 00:55:47,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:55:47" (3/3) ... [2024-11-22 00:55:47,256 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_nullified-1.i [2024-11-22 00:55:47,271 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 00:55:47,271 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 00:55:47,333 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 00:55:47,343 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;@21fca99c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 00:55:47,344 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 00:55:47,349 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 25 states have (on average 1.6) internal successors, (40), 26 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:55:47,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-22 00:55:47,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:55:47,358 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:55:47,359 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:55:47,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:55:47,365 INFO L85 PathProgramCache]: Analyzing trace with hash -91270904, now seen corresponding path program 1 times [2024-11-22 00:55:47,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:55:47,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258707676] [2024-11-22 00:55:47,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:55:47,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:55:47,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:55:47,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:55:47,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:55:47,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258707676] [2024-11-22 00:55:47,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258707676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:55:47,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:55:47,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 00:55:47,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600250473] [2024-11-22 00:55:47,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:55:47,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 00:55:47,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:55:47,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 00:55:47,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 00:55:47,772 INFO L87 Difference]: Start difference. First operand has 27 states, 25 states have (on average 1.6) internal successors, (40), 26 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:55:47,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:55:47,818 INFO L93 Difference]: Finished difference Result 52 states and 78 transitions. [2024-11-22 00:55:47,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 00:55:47,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-22 00:55:47,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:55:47,827 INFO L225 Difference]: With dead ends: 52 [2024-11-22 00:55:47,827 INFO L226 Difference]: Without dead ends: 27 [2024-11-22 00:55:47,829 INFO L431 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 [2024-11-22 00:55:47,832 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 7 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 00:55:47,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 63 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:55:47,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-22 00:55:47,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2024-11-22 00:55:47,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:55:47,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2024-11-22 00:55:47,857 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 12 [2024-11-22 00:55:47,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:55:47,857 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2024-11-22 00:55:47,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:55:47,858 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2024-11-22 00:55:47,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-22 00:55:47,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:55:47,858 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:55:47,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 00:55:47,859 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:55:47,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:55:47,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1034399597, now seen corresponding path program 1 times [2024-11-22 00:55:47,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:55:47,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681650424] [2024-11-22 00:55:47,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:55:47,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:55:47,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:55:48,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:55:48,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:55:48,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681650424] [2024-11-22 00:55:48,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681650424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:55:48,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:55:48,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 00:55:48,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126357280] [2024-11-22 00:55:48,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:55:48,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 00:55:48,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:55:48,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 00:55:48,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 00:55:48,054 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:55:48,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:55:48,097 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2024-11-22 00:55:48,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 00:55:48,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-22 00:55:48,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:55:48,099 INFO L225 Difference]: With dead ends: 46 [2024-11-22 00:55:48,099 INFO L226 Difference]: Without dead ends: 26 [2024-11-22 00:55:48,100 INFO L431 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 [2024-11-22 00:55:48,101 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 00:55:48,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:55:48,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-22 00:55:48,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-22 00:55:48,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:55:48,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2024-11-22 00:55:48,110 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 17 [2024-11-22 00:55:48,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:55:48,111 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2024-11-22 00:55:48,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:55:48,111 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2024-11-22 00:55:48,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-22 00:55:48,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:55:48,112 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:55:48,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 00:55:48,113 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:55:48,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:55:48,114 INFO L85 PathProgramCache]: Analyzing trace with hash -776234159, now seen corresponding path program 1 times [2024-11-22 00:55:48,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:55:48,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661276625] [2024-11-22 00:55:48,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:55:48,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:55:48,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:55:48,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:55:48,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:55:48,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661276625] [2024-11-22 00:55:48,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661276625] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:55:48,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579256480] [2024-11-22 00:55:48,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:55:48,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:55:48,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:55:48,247 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) [2024-11-22 00:55:48,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 00:55:48,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:55:48,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 00:55:48,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:55:48,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:55:48,423 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 00:55:48,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:55:48,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579256480] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 00:55:48,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 00:55:48,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-22 00:55:48,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284604873] [2024-11-22 00:55:48,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 00:55:48,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 00:55:48,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:55:48,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 00:55:48,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-22 00:55:48,467 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:55:48,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:55:48,578 INFO L93 Difference]: Finished difference Result 53 states and 72 transitions. [2024-11-22 00:55:48,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 00:55:48,579 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-22 00:55:48,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:55:48,580 INFO L225 Difference]: With dead ends: 53 [2024-11-22 00:55:48,580 INFO L226 Difference]: Without dead ends: 38 [2024-11-22 00:55:48,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-22 00:55:48,581 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 13 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 00:55:48,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 81 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 00:55:48,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-22 00:55:48,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-22 00:55:48,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:55:48,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2024-11-22 00:55:48,587 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 48 transitions. Word has length 17 [2024-11-22 00:55:48,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:55:48,587 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 48 transitions. [2024-11-22 00:55:48,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:55:48,588 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2024-11-22 00:55:48,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-22 00:55:48,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:55:48,589 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:55:48,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-22 00:55:48,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:55:48,792 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:55:48,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:55:48,792 INFO L85 PathProgramCache]: Analyzing trace with hash -459646902, now seen corresponding path program 1 times [2024-11-22 00:55:48,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:55:48,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121432666] [2024-11-22 00:55:48,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:55:48,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:55:48,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:55:49,142 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:55:49,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:55:49,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121432666] [2024-11-22 00:55:49,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121432666] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:55:49,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466114476] [2024-11-22 00:55:49,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:55:49,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:55:49,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:55:49,148 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) [2024-11-22 00:55:49,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 00:55:49,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:55:49,368 INFO L255 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 00:55:49,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:55:49,426 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:55:49,426 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 00:55:49,509 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:55:49,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1466114476] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 00:55:49,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 00:55:49,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2024-11-22 00:55:49,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301863149] [2024-11-22 00:55:49,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 00:55:49,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 00:55:49,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:55:49,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 00:55:49,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-22 00:55:49,511 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:55:49,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:55:49,652 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2024-11-22 00:55:49,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 00:55:49,655 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-22 00:55:49,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:55:49,655 INFO L225 Difference]: With dead ends: 58 [2024-11-22 00:55:49,656 INFO L226 Difference]: Without dead ends: 43 [2024-11-22 00:55:49,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 59 SyntacticMatches, 5 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-22 00:55:49,657 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 9 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 00:55:49,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 123 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 00:55:49,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-22 00:55:49,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-22 00:55:49,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:55:49,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2024-11-22 00:55:49,667 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 54 transitions. Word has length 32 [2024-11-22 00:55:49,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:55:49,668 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 54 transitions. [2024-11-22 00:55:49,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:55:49,668 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2024-11-22 00:55:49,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-22 00:55:49,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:55:49,670 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:55:49,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-22 00:55:49,870 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 [2024-11-22 00:55:49,871 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:55:49,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:55:49,872 INFO L85 PathProgramCache]: Analyzing trace with hash -910589295, now seen corresponding path program 2 times [2024-11-22 00:55:49,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:55:49,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673697254] [2024-11-22 00:55:49,872 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 00:55:49,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:55:49,967 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 00:55:49,969 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 00:55:50,635 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-22 00:55:50,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:55:50,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673697254] [2024-11-22 00:55:50,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673697254] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:55:50,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122912559] [2024-11-22 00:55:50,636 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 00:55:50,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:55:50,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:55:50,639 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) [2024-11-22 00:55:50,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-22 00:55:50,851 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 00:55:50,851 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 00:55:50,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-22 00:55:50,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:55:50,889 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 00:55:50,925 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 00:55:50,926 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 11 treesize of output 11 [2024-11-22 00:55:50,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2024-11-22 00:55:51,052 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 23 treesize of output 16 [2024-11-22 00:55:51,195 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-22 00:55:51,196 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 00:55:51,897 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:55:51,897 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 5 case distinctions, treesize of input 38 treesize of output 59 [2024-11-22 00:55:51,907 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:55:51,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 40 treesize of output 26 [2024-11-22 00:55:51,914 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 5 treesize of output 3 [2024-11-22 00:55:51,957 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-22 00:55:51,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122912559] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 00:55:51,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 00:55:51,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2024-11-22 00:55:51,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191533614] [2024-11-22 00:55:51,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 00:55:51,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-22 00:55:51,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:55:51,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-22 00:55:51,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=321, Unknown=6, NotChecked=0, Total=380 [2024-11-22 00:55:51,962 INFO L87 Difference]: Start difference. First operand 43 states and 54 transitions. Second operand has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:55:52,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:55:52,594 INFO L93 Difference]: Finished difference Result 69 states and 92 transitions. [2024-11-22 00:55:52,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-22 00:55:52,595 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-22 00:55:52,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:55:52,596 INFO L225 Difference]: With dead ends: 69 [2024-11-22 00:55:52,596 INFO L226 Difference]: Without dead ends: 56 [2024-11-22 00:55:52,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=145, Invalid=660, Unknown=7, NotChecked=0, Total=812 [2024-11-22 00:55:52,597 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 38 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 00:55:52,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 181 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 00:55:52,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-22 00:55:52,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 46. [2024-11-22 00:55:52,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.288888888888889) internal successors, (58), 45 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:55:52,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2024-11-22 00:55:52,603 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 37 [2024-11-22 00:55:52,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:55:52,603 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2024-11-22 00:55:52,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:55:52,604 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2024-11-22 00:55:52,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-22 00:55:52,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:55:52,605 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:55:52,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-22 00:55:52,805 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 [2024-11-22 00:55:52,806 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:55:52,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:55:52,806 INFO L85 PathProgramCache]: Analyzing trace with hash -908742253, now seen corresponding path program 1 times [2024-11-22 00:55:52,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:55:52,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839260547] [2024-11-22 00:55:52,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:55:52,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:55:52,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:55:53,710 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 28 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-22 00:55:53,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:55:53,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839260547] [2024-11-22 00:55:53,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839260547] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:55:53,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126118389] [2024-11-22 00:55:53,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:55:53,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:55:53,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:55:53,714 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) [2024-11-22 00:55:53,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-22 00:55:53,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:55:53,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-22 00:55:53,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:55:53,936 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 00:55:53,952 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 00:55:53,953 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 11 treesize of output 11 [2024-11-22 00:55:53,985 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 76 treesize of output 71 [2024-11-22 00:55:53,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 112 [2024-11-22 00:55:54,062 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:55:54,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 143 [2024-11-22 00:55:54,109 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 00:55:54,111 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 00:55:54,112 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 00:55:54,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 26 [2024-11-22 00:55:54,184 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 62 treesize of output 47 [2024-11-22 00:55:54,406 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:55:54,407 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 79 treesize of output 35 [2024-11-22 00:55:54,414 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-22 00:55:54,414 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 00:55:54,532 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_990 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_990) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) 0)) is different from false [2024-11-22 00:55:54,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 90 treesize of output 86 [2024-11-22 00:55:54,572 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:55:54,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 62 treesize of output 123 [2024-11-22 00:55:54,585 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 11 treesize of output 7 [2024-11-22 00:55:54,663 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 1 not checked. [2024-11-22 00:55:54,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126118389] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 00:55:54,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 00:55:54,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 26 [2024-11-22 00:55:54,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477708144] [2024-11-22 00:55:54,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 00:55:54,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-22 00:55:54,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:55:54,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-22 00:55:54,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=533, Unknown=1, NotChecked=46, Total=650 [2024-11-22 00:55:54,666 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand has 26 states, 26 states have (on average 2.269230769230769) internal successors, (59), 26 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:55:55,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:55:55,279 INFO L93 Difference]: Finished difference Result 69 states and 91 transitions. [2024-11-22 00:55:55,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 00:55:55,279 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.269230769230769) internal successors, (59), 26 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-22 00:55:55,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:55:55,280 INFO L225 Difference]: With dead ends: 69 [2024-11-22 00:55:55,280 INFO L226 Difference]: Without dead ends: 56 [2024-11-22 00:55:55,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=150, Invalid=975, Unknown=1, NotChecked=64, Total=1190 [2024-11-22 00:55:55,282 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 40 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 00:55:55,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 177 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 268 Invalid, 0 Unknown, 36 Unchecked, 0.3s Time] [2024-11-22 00:55:55,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-22 00:55:55,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2024-11-22 00:55:55,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 47 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:55:55,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2024-11-22 00:55:55,292 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 37 [2024-11-22 00:55:55,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:55:55,293 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2024-11-22 00:55:55,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.269230769230769) internal successors, (59), 26 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:55:55,294 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2024-11-22 00:55:55,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-22 00:55:55,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:55:55,295 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:55:55,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-22 00:55:55,496 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 [2024-11-22 00:55:55,496 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:55:55,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:55:55,497 INFO L85 PathProgramCache]: Analyzing trace with hash -908740331, now seen corresponding path program 1 times [2024-11-22 00:55:55,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:55:55,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135356600] [2024-11-22 00:55:55,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:55:55,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:55:55,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 00:55:55,568 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 00:55:55,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 00:55:55,656 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 00:55:55,657 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 00:55:55,660 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 00:55:55,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 00:55:55,665 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2024-11-22 00:55:55,700 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 00:55:55,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 12:55:55 BoogieIcfgContainer [2024-11-22 00:55:55,704 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 00:55:55,705 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 00:55:55,705 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 00:55:55,705 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 00:55:55,705 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:55:47" (3/4) ... [2024-11-22 00:55:55,706 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-22 00:55:55,763 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-22 00:55:55,764 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 00:55:55,764 INFO L158 Benchmark]: Toolchain (without parser) took 9528.47ms. Allocated memory was 167.8MB in the beginning and 218.1MB in the end (delta: 50.3MB). Free memory was 95.2MB in the beginning and 61.9MB in the end (delta: 33.3MB). Peak memory consumption was 84.0MB. Max. memory is 16.1GB. [2024-11-22 00:55:55,764 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 121.6MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 00:55:55,765 INFO L158 Benchmark]: CACSL2BoogieTranslator took 534.73ms. Allocated memory is still 167.8MB. Free memory was 95.2MB in the beginning and 75.3MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-22 00:55:55,765 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.29ms. Allocated memory is still 167.8MB. Free memory was 75.3MB in the beginning and 73.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 00:55:55,765 INFO L158 Benchmark]: Boogie Preprocessor took 54.16ms. Allocated memory is still 167.8MB. Free memory was 73.2MB in the beginning and 70.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 00:55:55,768 INFO L158 Benchmark]: RCFGBuilder took 366.26ms. Allocated memory is still 167.8MB. Free memory was 70.8MB in the beginning and 54.7MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-22 00:55:55,768 INFO L158 Benchmark]: TraceAbstraction took 8456.95ms. Allocated memory was 167.8MB in the beginning and 218.1MB in the end (delta: 50.3MB). Free memory was 54.1MB in the beginning and 65.0MB in the end (delta: -11.0MB). Peak memory consumption was 42.0MB. Max. memory is 16.1GB. [2024-11-22 00:55:55,768 INFO L158 Benchmark]: Witness Printer took 59.19ms. Allocated memory is still 218.1MB. Free memory was 64.0MB in the beginning and 61.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 00:55:55,770 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.21ms. Allocated memory is still 121.6MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 534.73ms. Allocated memory is still 167.8MB. Free memory was 95.2MB in the beginning and 75.3MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.29ms. Allocated memory is still 167.8MB. Free memory was 75.3MB in the beginning and 73.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.16ms. Allocated memory is still 167.8MB. Free memory was 73.2MB in the beginning and 70.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 366.26ms. Allocated memory is still 167.8MB. Free memory was 70.8MB in the beginning and 54.7MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8456.95ms. Allocated memory was 167.8MB in the beginning and 218.1MB in the end (delta: 50.3MB). Free memory was 54.1MB in the beginning and 65.0MB in the end (delta: -11.0MB). Peak memory consumption was 42.0MB. Max. memory is 16.1GB. * Witness Printer took 59.19ms. Allocated memory is still 218.1MB. Free memory was 64.0MB in the beginning and 61.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. 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: 616]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L599] const int len = 5; [L600] CALL, EXPR dll_create(len) [L579] DLL head = ((void *)0); VAL [head={0:0}, len=5] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [head={0:0}, len=5, new_head={-1:0}] [L585] new_head->data_0 = 0 [L586] new_head->data_1 = 0 [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L588] new_head->next = head [L589] new_head->prev = ((void *)0) [L590] COND FALSE !(\read(head)) [L593] head = new_head [L594] len-- [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [head={-1:0}, len=4, new_head={-2:0}] [L585] new_head->data_0 = 0 [L586] new_head->data_1 = 0 [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L588] new_head->next = head [L589] new_head->prev = ((void *)0) [L590] COND TRUE \read(head) [L591] head->prev = new_head [L593] head = new_head [L594] len-- [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [head={-2:0}, len=3, new_head={-3:0}] [L585] new_head->data_0 = 0 [L586] new_head->data_1 = 0 [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L588] new_head->next = head [L589] new_head->prev = ((void *)0) [L590] COND TRUE \read(head) [L591] head->prev = new_head [L593] head = new_head [L594] len-- [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [head={-3:0}, len=2, new_head={-4:0}] [L585] new_head->data_0 = 0 [L586] new_head->data_1 = 0 [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L588] new_head->next = head [L589] new_head->prev = ((void *)0) [L590] COND TRUE \read(head) [L591] head->prev = new_head [L593] head = new_head [L594] len-- [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [head={-4:0}, len=1, new_head={-5:0}] [L585] new_head->data_0 = 0 [L586] new_head->data_1 = 0 [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L588] new_head->next = head [L589] new_head->prev = ((void *)0) [L590] COND TRUE \read(head) [L591] head->prev = new_head [L593] head = new_head [L594] len-- [L580] COND FALSE !(len > 0) VAL [head={-5:0}] [L596] return head; VAL [\result={-5:0}] [L600] RET, EXPR dll_create(len) [L600] DLL head = dll_create(len); [L601] head->next [L601] COND TRUE head->next [L602] EXPR head->data_0 [L602] EXPR 0 != head->data_0 || 0 != head->data_1 VAL [head={-5:0}] [L602] EXPR 0 != head->data_0 || 0 != head->data_1 [L602] EXPR head->data_1 [L602] EXPR 0 != head->data_0 || 0 != head->data_1 VAL [head={-5:0}] [L602] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 VAL [head={-5:0}] [L602] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L602] EXPR head->data_2 [L602] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 VAL [head={-5:0}] [L602] COND TRUE 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L616] reach_error() VAL [head={-5:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.4s, OverallIterations: 7, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 107 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 107 mSDsluCounter, 676 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 36 IncrementalHoareTripleChecker+Unchecked, 533 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 703 IncrementalHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 143 mSDtfsCounter, 703 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 300 GetRequests, 223 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=6, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 22 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 312 NumberOfCodeBlocks, 312 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 384 ConstructedInterpolants, 2 QuantifiedInterpolants, 1560 SizeOfPredicates, 11 NumberOfNonLiveVariables, 1438 ConjunctsInSsa, 80 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 289/436 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-22 00:55:55,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE