./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/dll-optional-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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/forester-heap/dll-optional-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 1c592bb1d39faa1e5f3d20603a8bfbb8fe6cff4de59ea35fafbddd50b8917b41 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 13:03:19,790 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 13:03:19,879 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 13:03:19,884 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 13:03:19,886 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 13:03:19,904 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 13:03:19,905 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 13:03:19,906 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 13:03:19,906 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 13:03:19,910 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 13:03:19,911 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 13:03:19,911 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 13:03:19,911 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 13:03:19,912 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 13:03:19,912 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 13:03:19,912 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 13:03:19,912 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 13:03:19,913 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 13:03:19,913 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 13:03:19,913 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 13:03:19,913 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 13:03:19,915 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 13:03:19,915 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 13:03:19,915 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 13:03:19,916 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 13:03:19,916 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 13:03:19,916 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 13:03:19,916 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 13:03:19,917 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 13:03:19,917 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 13:03:19,917 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 13:03:19,918 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 13:03:19,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 13:03:19,918 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 13:03:19,919 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 13:03:19,919 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 13:03:19,919 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 13:03:19,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 13:03:19,920 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 13:03:19,920 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 13:03:19,920 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 13:03:19,921 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 13:03:19,921 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 -> 1c592bb1d39faa1e5f3d20603a8bfbb8fe6cff4de59ea35fafbddd50b8917b41 [2024-11-18 13:03:20,195 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 13:03:20,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 13:03:20,226 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 13:03:20,228 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 13:03:20,228 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 13:03:20,230 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-optional-1.i [2024-11-18 13:03:21,727 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 13:03:21,958 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 13:03:21,959 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-optional-1.i [2024-11-18 13:03:21,981 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/473d862ef/b20ad1c413294e5097e93bf1e1676549/FLAG646b4a3ae [2024-11-18 13:03:21,995 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/473d862ef/b20ad1c413294e5097e93bf1e1676549 [2024-11-18 13:03:21,997 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 13:03:21,998 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 13:03:22,000 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 13:03:22,000 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 13:03:22,004 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 13:03:22,004 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:03:21" (1/1) ... [2024-11-18 13:03:22,005 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e1bc29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:03:22, skipping insertion in model container [2024-11-18 13:03:22,005 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:03:21" (1/1) ... [2024-11-18 13:03:22,045 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 13:03:22,379 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/forester-heap/dll-optional-1.i[22753,22766] [2024-11-18 13:03:22,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 13:03:22,397 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 13:03:22,436 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/forester-heap/dll-optional-1.i[22753,22766] [2024-11-18 13:03:22,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 13:03:22,485 INFO L204 MainTranslator]: Completed translation [2024-11-18 13:03:22,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:03:22 WrapperNode [2024-11-18 13:03:22,486 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 13:03:22,487 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 13:03:22,487 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 13:03:22,488 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 13:03:22,495 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:03:22" (1/1) ... [2024-11-18 13:03:22,514 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:03:22" (1/1) ... [2024-11-18 13:03:22,545 INFO L138 Inliner]: procedures = 119, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 137 [2024-11-18 13:03:22,546 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 13:03:22,548 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 13:03:22,549 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 13:03:22,549 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 13:03:22,559 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:03:22" (1/1) ... [2024-11-18 13:03:22,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:03:22" (1/1) ... [2024-11-18 13:03:22,563 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:03:22" (1/1) ... [2024-11-18 13:03:22,586 INFO L175 MemorySlicer]: Split 34 memory accesses to 2 slices as follows [2, 32]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 19 writes are split as follows [0, 19]. [2024-11-18 13:03:22,586 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:03:22" (1/1) ... [2024-11-18 13:03:22,587 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:03:22" (1/1) ... [2024-11-18 13:03:22,595 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:03:22" (1/1) ... [2024-11-18 13:03:22,599 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:03:22" (1/1) ... [2024-11-18 13:03:22,601 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:03:22" (1/1) ... [2024-11-18 13:03:22,603 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:03:22" (1/1) ... [2024-11-18 13:03:22,610 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 13:03:22,611 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 13:03:22,611 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 13:03:22,611 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 13:03:22,612 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:03:22" (1/1) ... [2024-11-18 13:03:22,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 13:03:22,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:03:22,655 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-18 13:03:22,662 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-18 13:03:22,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-18 13:03:22,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-18 13:03:22,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-18 13:03:22,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-18 13:03:22,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-18 13:03:22,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 13:03:22,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-18 13:03:22,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-18 13:03:22,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-18 13:03:22,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-18 13:03:22,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-18 13:03:22,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 13:03:22,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-18 13:03:22,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 13:03:22,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 13:03:22,861 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 13:03:22,864 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 13:03:23,215 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-11-18 13:03:23,215 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 13:03:23,227 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 13:03:23,227 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-18 13:03:23,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:03:23 BoogieIcfgContainer [2024-11-18 13:03:23,228 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 13:03:23,230 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 13:03:23,231 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 13:03:23,234 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 13:03:23,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 01:03:21" (1/3) ... [2024-11-18 13:03:23,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10fa6b6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:03:23, skipping insertion in model container [2024-11-18 13:03:23,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:03:22" (2/3) ... [2024-11-18 13:03:23,239 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10fa6b6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:03:23, skipping insertion in model container [2024-11-18 13:03:23,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:03:23" (3/3) ... [2024-11-18 13:03:23,241 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-optional-1.i [2024-11-18 13:03:23,255 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 13:03:23,255 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 13:03:23,319 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 13:03:23,326 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;@4f670273, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 13:03:23,326 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 13:03:23,333 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 29 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-18 13:03:23,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-18 13:03:23,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:03:23,340 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:03:23,340 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:03:23,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:03:23,346 INFO L85 PathProgramCache]: Analyzing trace with hash 573386926, now seen corresponding path program 1 times [2024-11-18 13:03:23,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:03:23,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749882901] [2024-11-18 13:03:23,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:03:23,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:03:23,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:03:23,604 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-18 13:03:23,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:03:23,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749882901] [2024-11-18 13:03:23,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749882901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:03:23,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:03:23,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 13:03:23,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403958896] [2024-11-18 13:03:23,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:03:23,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 13:03:23,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:03:23,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 13:03:23,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 13:03:23,638 INFO L87 Difference]: Start difference. First operand has 30 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 29 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) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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-18 13:03:23,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:03:23,658 INFO L93 Difference]: Finished difference Result 51 states and 77 transitions. [2024-11-18 13:03:23,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 13:03:23,661 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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 15 [2024-11-18 13:03:23,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:03:23,671 INFO L225 Difference]: With dead ends: 51 [2024-11-18 13:03:23,671 INFO L226 Difference]: Without dead ends: 22 [2024-11-18 13:03:23,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 13:03:23,680 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 13:03:23,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:03:23,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-18 13:03:23,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-18 13:03:23,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 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-18 13:03:23,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2024-11-18 13:03:23,719 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 15 [2024-11-18 13:03:23,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:03:23,720 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2024-11-18 13:03:23,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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-18 13:03:23,721 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2024-11-18 13:03:23,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-18 13:03:23,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:03:23,723 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:03:23,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 13:03:23,724 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:03:23,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:03:23,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1170055612, now seen corresponding path program 1 times [2024-11-18 13:03:23,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:03:23,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625752574] [2024-11-18 13:03:23,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:03:23,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:03:23,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:03:23,940 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-18 13:03:23,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:03:23,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625752574] [2024-11-18 13:03:23,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625752574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:03:23,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:03:23,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 13:03:23,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108197563] [2024-11-18 13:03:23,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:03:23,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 13:03:23,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:03:23,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 13:03:23,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 13:03:23,949 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-18 13:03:23,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:03:23,982 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2024-11-18 13:03:23,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 13:03:23,983 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 16 [2024-11-18 13:03:23,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:03:23,984 INFO L225 Difference]: With dead ends: 36 [2024-11-18 13:03:23,984 INFO L226 Difference]: Without dead ends: 24 [2024-11-18 13:03:23,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 13:03:23,987 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 13:03:23,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:03:23,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-18 13:03:23,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-18 13:03:23,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 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-18 13:03:23,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2024-11-18 13:03:23,994 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 16 [2024-11-18 13:03:23,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:03:23,995 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2024-11-18 13:03:23,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-18 13:03:23,995 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2024-11-18 13:03:23,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-18 13:03:23,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:03:23,996 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:03:23,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 13:03:23,997 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:03:23,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:03:23,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1170053690, now seen corresponding path program 1 times [2024-11-18 13:03:23,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:03:23,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25129296] [2024-11-18 13:03:23,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:03:23,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:03:24,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:03:24,311 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-18 13:03:24,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:03:24,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25129296] [2024-11-18 13:03:24,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25129296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:03:24,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:03:24,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 13:03:24,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581121588] [2024-11-18 13:03:24,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:03:24,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 13:03:24,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:03:24,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 13:03:24,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-18 13:03:24,316 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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-18 13:03:24,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:03:24,482 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2024-11-18 13:03:24,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 13:03:24,482 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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 16 [2024-11-18 13:03:24,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:03:24,483 INFO L225 Difference]: With dead ends: 37 [2024-11-18 13:03:24,483 INFO L226 Difference]: Without dead ends: 35 [2024-11-18 13:03:24,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-18 13:03:24,486 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 13 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 13:03:24,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 69 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 13:03:24,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-18 13:03:24,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2024-11-18 13:03:24,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 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-18 13:03:24,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2024-11-18 13:03:24,495 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 16 [2024-11-18 13:03:24,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:03:24,496 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2024-11-18 13:03:24,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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-18 13:03:24,496 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2024-11-18 13:03:24,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-18 13:03:24,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:03:24,497 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:03:24,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 13:03:24,497 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:03:24,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:03:24,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1171900732, now seen corresponding path program 1 times [2024-11-18 13:03:24,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:03:24,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266708043] [2024-11-18 13:03:24,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:03:24,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:03:24,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:03:25,102 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-18 13:03:25,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:03:25,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266708043] [2024-11-18 13:03:25,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266708043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:03:25,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:03:25,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-18 13:03:25,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426781495] [2024-11-18 13:03:25,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:03:25,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 13:03:25,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:03:25,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 13:03:25,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-18 13:03:25,106 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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-18 13:03:25,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:03:25,435 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2024-11-18 13:03:25,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 13:03:25,437 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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 16 [2024-11-18 13:03:25,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:03:25,438 INFO L225 Difference]: With dead ends: 93 [2024-11-18 13:03:25,439 INFO L226 Difference]: Without dead ends: 74 [2024-11-18 13:03:25,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2024-11-18 13:03:25,440 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 88 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 13:03:25,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 77 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 13:03:25,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-18 13:03:25,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 42. [2024-11-18 13:03:25,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 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-18 13:03:25,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2024-11-18 13:03:25,454 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 16 [2024-11-18 13:03:25,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:03:25,455 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2024-11-18 13:03:25,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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-18 13:03:25,456 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2024-11-18 13:03:25,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-18 13:03:25,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:03:25,456 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:03:25,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 13:03:25,457 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:03:25,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:03:25,458 INFO L85 PathProgramCache]: Analyzing trace with hash 604953672, now seen corresponding path program 1 times [2024-11-18 13:03:25,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:03:25,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649744921] [2024-11-18 13:03:25,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:03:25,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:03:25,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:03:25,599 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-18 13:03:25,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:03:25,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649744921] [2024-11-18 13:03:25,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649744921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:03:25,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:03:25,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 13:03:25,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345411191] [2024-11-18 13:03:25,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:03:25,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 13:03:25,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:03:25,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 13:03:25,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 13:03:25,601 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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-18 13:03:25,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:03:25,749 INFO L93 Difference]: Finished difference Result 87 states and 108 transitions. [2024-11-18 13:03:25,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 13:03:25,750 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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 16 [2024-11-18 13:03:25,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:03:25,750 INFO L225 Difference]: With dead ends: 87 [2024-11-18 13:03:25,750 INFO L226 Difference]: Without dead ends: 64 [2024-11-18 13:03:25,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-18 13:03:25,752 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 81 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 13:03:25,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 75 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 13:03:25,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-18 13:03:25,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 40. [2024-11-18 13:03:25,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 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-18 13:03:25,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2024-11-18 13:03:25,764 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 16 [2024-11-18 13:03:25,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:03:25,764 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2024-11-18 13:03:25,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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-18 13:03:25,764 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2024-11-18 13:03:25,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-18 13:03:25,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:03:25,765 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:03:25,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 13:03:25,765 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:03:25,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:03:25,766 INFO L85 PathProgramCache]: Analyzing trace with hash 466614784, now seen corresponding path program 1 times [2024-11-18 13:03:25,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:03:25,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916459946] [2024-11-18 13:03:25,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:03:25,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:03:25,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:03:25,969 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-18 13:03:25,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:03:25,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916459946] [2024-11-18 13:03:25,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916459946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:03:25,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:03:25,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 13:03:25,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992436246] [2024-11-18 13:03:25,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:03:25,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 13:03:25,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:03:25,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 13:03:25,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 13:03:25,974 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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-18 13:03:26,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:03:26,174 INFO L93 Difference]: Finished difference Result 101 states and 125 transitions. [2024-11-18 13:03:26,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-18 13:03:26,175 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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-18 13:03:26,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:03:26,176 INFO L225 Difference]: With dead ends: 101 [2024-11-18 13:03:26,176 INFO L226 Difference]: Without dead ends: 82 [2024-11-18 13:03:26,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-18 13:03:26,177 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 44 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 13:03:26,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 125 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 13:03:26,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-18 13:03:26,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 48. [2024-11-18 13:03:26,187 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-18 13:03:26,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2024-11-18 13:03:26,188 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 17 [2024-11-18 13:03:26,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:03:26,189 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2024-11-18 13:03:26,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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-18 13:03:26,189 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2024-11-18 13:03:26,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-18 13:03:26,190 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:03:26,191 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:03:26,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 13:03:26,191 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:03:26,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:03:26,191 INFO L85 PathProgramCache]: Analyzing trace with hash -2051498108, now seen corresponding path program 1 times [2024-11-18 13:03:26,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:03:26,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449148956] [2024-11-18 13:03:26,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:03:26,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:03:26,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:03:26,336 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-18 13:03:26,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:03:26,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449148956] [2024-11-18 13:03:26,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449148956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:03:26,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:03:26,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 13:03:26,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110831135] [2024-11-18 13:03:26,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:03:26,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 13:03:26,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:03:26,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 13:03:26,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 13:03:26,339 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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-18 13:03:26,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:03:26,481 INFO L93 Difference]: Finished difference Result 84 states and 100 transitions. [2024-11-18 13:03:26,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-18 13:03:26,482 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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-18 13:03:26,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:03:26,482 INFO L225 Difference]: With dead ends: 84 [2024-11-18 13:03:26,483 INFO L226 Difference]: Without dead ends: 82 [2024-11-18 13:03:26,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-18 13:03:26,484 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 35 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 13:03:26,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 110 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 13:03:26,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-18 13:03:26,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 48. [2024-11-18 13:03:26,492 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-18 13:03:26,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2024-11-18 13:03:26,492 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 17 [2024-11-18 13:03:26,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:03:26,493 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2024-11-18 13:03:26,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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-18 13:03:26,493 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2024-11-18 13:03:26,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-18 13:03:26,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:03:26,494 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:03:26,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 13:03:26,494 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:03:26,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:03:26,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1690516158, now seen corresponding path program 1 times [2024-11-18 13:03:26,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:03:26,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115961638] [2024-11-18 13:03:26,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:03:26,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:03:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:03:27,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:03:27,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:03:27,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115961638] [2024-11-18 13:03:27,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115961638] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:03:27,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464356889] [2024-11-18 13:03:27,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:03:27,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:03:27,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:03:27,350 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-18 13:03:27,351 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-18 13:03:27,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:03:27,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-11-18 13:03:27,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:03:27,562 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-18 13:03:27,632 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2024-11-18 13:03:27,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2024-11-18 13:03:27,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2024-11-18 13:03:27,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 11 [2024-11-18 13:03:27,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:03:27,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2024-11-18 13:03:27,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:03:27,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:03:27,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:03:27,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2024-11-18 13:03:27,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:03:27,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:03:27,879 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-18 13:03:27,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 52 [2024-11-18 13:03:27,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:03:27,904 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-18 13:03:27,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 48 [2024-11-18 13:03:27,947 INFO L349 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2024-11-18 13:03:27,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2024-11-18 13:03:28,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:03:28,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:03:28,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:03:28,014 INFO L349 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2024-11-18 13:03:28,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 55 [2024-11-18 13:03:28,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:03:28,166 INFO L349 Elim1Store]: treesize reduction 87, result has 11.2 percent of original size [2024-11-18 13:03:28,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 129 treesize of output 102 [2024-11-18 13:03:28,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:03:28,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:03:28,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:03:28,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 50 [2024-11-18 13:03:28,206 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 12 treesize of output 11 [2024-11-18 13:03:28,227 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-18 13:03:28,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 25 [2024-11-18 13:03:28,236 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 8 treesize of output 7 [2024-11-18 13:03:28,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:03:28,937 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-18 13:03:28,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 41 [2024-11-18 13:03:29,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:03:29,129 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:03:29,341 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:03:29,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 179 treesize of output 147 [2024-11-18 13:03:30,007 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse9 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse7 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| 0)))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_8| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc11#1.base_8| Int) (v_ArrVal_357 (Array Int Int))) (or (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_8| 1) |v_ULTIMATE.start_main_#t~malloc11#1.base_8|) 0)) (forall ((v_arrayElimArr_4 (Array Int Int))) (let ((.cse4 (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_8|)))) (store .cse8 |v_ULTIMATE.start_main_#t~malloc7#1.base_8| (store (select .cse8 |v_ULTIMATE.start_main_#t~malloc7#1.base_8|) 4 |c_ULTIMATE.start_main_~x~0#1.base|))))) (let ((.cse0 (store .cse7 |v_ULTIMATE.start_main_#t~malloc7#1.base_8| v_ArrVal_357)) (.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse1 (select (select (let ((.cse6 (store .cse0 .cse5 v_arrayElimArr_4))) (store .cse6 |v_ULTIMATE.start_main_#t~malloc11#1.base_8| (store (select .cse6 |v_ULTIMATE.start_main_#t~malloc11#1.base_8|) 0 0))) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (not (= (select v_arrayElimArr_4 (+ (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 8)) 0)) (= .cse1 |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_360 (Array Int Int)) (v_ArrVal_364 (Array Int Int))) (= (select (let ((.cse2 (store (store .cse4 .cse5 v_ArrVal_364) |v_ULTIMATE.start_main_#t~malloc11#1.base_8| v_ArrVal_360))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) .cse1) 0))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_8|) 0)))) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_8| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc11#1.base_8| Int) (v_ArrVal_357 (Array Int Int))) (or (forall ((v_arrayElimArr_4 (Array Int Int))) (let ((.cse12 (let ((.cse16 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_8|)))) (store .cse16 |v_ULTIMATE.start_main_#t~malloc7#1.base_8| (store (select .cse16 |v_ULTIMATE.start_main_#t~malloc7#1.base_8|) 4 |c_ULTIMATE.start_main_~x~0#1.base|))))) (let ((.cse10 (store .cse7 |v_ULTIMATE.start_main_#t~malloc7#1.base_8| v_ArrVal_357)) (.cse13 (select (select .cse12 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse11 (let ((.cse15 (store .cse10 .cse13 v_arrayElimArr_4))) (store .cse15 |v_ULTIMATE.start_main_#t~malloc11#1.base_8| (store (select .cse15 |v_ULTIMATE.start_main_#t~malloc11#1.base_8|) 0 0))))) (let ((.cse14 (select (select .cse11 |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (not (= (select v_arrayElimArr_4 (+ (select (select .cse10 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 8)) 0)) (forall ((v_ArrVal_360 (Array Int Int)) (v_ArrVal_364 (Array Int Int))) (= (select (select .cse11 (select (select (store (store .cse12 .cse13 v_ArrVal_364) |v_ULTIMATE.start_main_#t~malloc11#1.base_8| v_ArrVal_360) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) .cse14) 0)) (= .cse14 |c_ULTIMATE.start_main_~head~0#1.offset|))))))) (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_8| 1) |v_ULTIMATE.start_main_#t~malloc11#1.base_8|) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_8|) 0)))) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_8| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_8|) 0)) (forall ((|v_ULTIMATE.start_main_#t~malloc11#1.base_8| Int) (v_ArrVal_357 (Array Int Int))) (or (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_8| 1) |v_ULTIMATE.start_main_#t~malloc11#1.base_8|) 0)) (forall ((v_arrayElimArr_4 (Array Int Int))) (let ((.cse17 (store .cse7 |v_ULTIMATE.start_main_#t~malloc7#1.base_8| v_ArrVal_357))) (or (not (= (select v_arrayElimArr_4 (+ (select (select .cse17 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 8)) 0)) (forall ((v_ArrVal_360 (Array Int Int)) (v_ArrVal_364 (Array Int Int))) (let ((.cse22 (let ((.cse23 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_8|)))) (store .cse23 |v_ULTIMATE.start_main_#t~malloc7#1.base_8| (store (select .cse23 |v_ULTIMATE.start_main_#t~malloc7#1.base_8|) 4 |c_ULTIMATE.start_main_~x~0#1.base|))))) (let ((.cse21 (select (select .cse22 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse18 (select (select (store (store .cse22 .cse21 v_ArrVal_364) |v_ULTIMATE.start_main_#t~malloc11#1.base_8| v_ArrVal_360) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse18 |c_ULTIMATE.start_main_~head~0#1.base|) (= (let ((.cse19 (let ((.cse20 (store .cse17 .cse21 v_arrayElimArr_4))) (store .cse20 |v_ULTIMATE.start_main_#t~malloc11#1.base_8| (store (select .cse20 |v_ULTIMATE.start_main_#t~malloc11#1.base_8|) 0 0))))) (select (select .cse19 .cse18) (select (select .cse19 |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) 0))))))))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_8| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc11#1.base_8| Int) (v_ArrVal_357 (Array Int Int))) (or (forall ((v_arrayElimArr_4 (Array Int Int))) (let ((.cse24 (store .cse7 |v_ULTIMATE.start_main_#t~malloc7#1.base_8| v_ArrVal_357))) (or (not (= (select v_arrayElimArr_4 (+ (select (select .cse24 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 8)) 0)) (forall ((v_ArrVal_360 (Array Int Int)) (v_ArrVal_364 (Array Int Int))) (let ((.cse29 (let ((.cse30 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_8|)))) (store .cse30 |v_ULTIMATE.start_main_#t~malloc7#1.base_8| (store (select .cse30 |v_ULTIMATE.start_main_#t~malloc7#1.base_8|) 4 |c_ULTIMATE.start_main_~x~0#1.base|))))) (let ((.cse28 (select (select .cse29 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse26 (store (store .cse29 .cse28 v_ArrVal_364) |v_ULTIMATE.start_main_#t~malloc11#1.base_8| v_ArrVal_360))) (let ((.cse25 (select (select .cse26 |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse25 |c_ULTIMATE.start_main_~head~0#1.base|) (= (select (select .cse26 .cse25) (select (select (let ((.cse27 (store .cse24 .cse28 v_arrayElimArr_4))) (store .cse27 |v_ULTIMATE.start_main_#t~malloc11#1.base_8| (store (select .cse27 |v_ULTIMATE.start_main_#t~malloc11#1.base_8|) 0 0))) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) 0)))))))))) (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_8| 1) |v_ULTIMATE.start_main_#t~malloc11#1.base_8|) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_8|) 0)))))) is different from false [2024-11-18 13:03:48,166 WARN L286 SmtUtils]: Spent 12.05s on a formula simplification. DAG size of input: 195 DAG size of output: 117 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-18 13:03:48,167 INFO L349 Elim1Store]: treesize reduction 3682, result has 30.5 percent of original size [2024-11-18 13:03:48,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 29 case distinctions, treesize of input 617823729 treesize of output 602799039 [2024-11-18 13:03:57,078 WARN L286 SmtUtils]: Spent 8.83s on a formula simplification. DAG size of input: 8207 DAG size of output: 1646 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-18 13:04:34,925 WARN L286 SmtUtils]: Spent 35.27s on a formula simplification. DAG size of input: 646 DAG size of output: 186 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-18 13:04:34,926 INFO L349 Elim1Store]: treesize reduction 1316, result has 21.0 percent of original size [2024-11-18 13:04:34,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 25 new quantified variables, introduced 137 case distinctions, treesize of input 2661947560 treesize of output 1849754605