./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/length_test03-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext2/length_test03-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6e9221de91e231efa38b63f264828813e89f68c8ac306a629b3513c0e7bf1ed0 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:46:37,125 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:46:37,202 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 07:46:37,209 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:46:37,210 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:46:37,244 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:46:37,246 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:46:37,247 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:46:37,247 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:46:37,249 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:46:37,250 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:46:37,250 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:46:37,251 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:46:37,252 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:46:37,252 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:46:37,253 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:46:37,253 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:46:37,253 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:46:37,253 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:46:37,254 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:46:37,254 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:46:37,256 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:46:37,256 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:46:37,257 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:46:37,257 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:46:37,257 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:46:37,258 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:46:37,258 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:46:37,258 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:46:37,258 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:46:37,259 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:46:37,259 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:46:37,259 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:46:37,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:46:37,260 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:46:37,260 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:46:37,261 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:46:37,261 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:46:37,261 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:46:37,261 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:46:37,268 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:46:37,269 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:46:37,269 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 6e9221de91e231efa38b63f264828813e89f68c8ac306a629b3513c0e7bf1ed0 [2024-11-09 07:46:37,518 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:46:37,545 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:46:37,549 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:46:37,550 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:46:37,550 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:46:37,552 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/length_test03-1.i [2024-11-09 07:46:39,037 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:46:39,256 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:46:39,257 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/length_test03-1.i [2024-11-09 07:46:39,269 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7014ba80d/ea5aeacd7be544cb829741bf1745eb1c/FLAG7e244ba95 [2024-11-09 07:46:39,280 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7014ba80d/ea5aeacd7be544cb829741bf1745eb1c [2024-11-09 07:46:39,282 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:46:39,283 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:46:39,284 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:46:39,284 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:46:39,289 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:46:39,289 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:46:39" (1/1) ... [2024-11-09 07:46:39,290 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6388f397 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:46:39, skipping insertion in model container [2024-11-09 07:46:39,290 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:46:39" (1/1) ... [2024-11-09 07:46:39,333 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:46:39,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:46:39,676 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:46:39,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:46:39,748 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:46:39,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:46:39 WrapperNode [2024-11-09 07:46:39,749 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:46:39,750 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:46:39,751 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:46:39,751 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:46:39,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:46:39" (1/1) ... [2024-11-09 07:46:39,775 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:46:39" (1/1) ... [2024-11-09 07:46:39,801 INFO L138 Inliner]: procedures = 123, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 102 [2024-11-09 07:46:39,802 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:46:39,802 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:46:39,803 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:46:39,803 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:46:39,814 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:46:39" (1/1) ... [2024-11-09 07:46:39,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:46:39" (1/1) ... [2024-11-09 07:46:39,818 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:46:39" (1/1) ... [2024-11-09 07:46:39,839 INFO L175 MemorySlicer]: Split 25 memory accesses to 3 slices as follows [2, 13, 10]. 52 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 13 writes are split as follows [0, 7, 6]. [2024-11-09 07:46:39,839 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:46:39" (1/1) ... [2024-11-09 07:46:39,839 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:46:39" (1/1) ... [2024-11-09 07:46:39,847 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:46:39" (1/1) ... [2024-11-09 07:46:39,853 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:46:39" (1/1) ... [2024-11-09 07:46:39,855 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:46:39" (1/1) ... [2024-11-09 07:46:39,856 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:46:39" (1/1) ... [2024-11-09 07:46:39,859 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:46:39,860 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:46:39,860 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:46:39,860 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:46:39,861 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:46:39" (1/1) ... [2024-11-09 07:46:39,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:46:39,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:46:39,895 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-09 07:46:39,897 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-09 07:46:39,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 07:46:39,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 07:46:39,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 07:46:39,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:46:39,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:46:39,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 07:46:39,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 07:46:39,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 07:46:39,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 07:46:39,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 07:46:39,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 07:46:39,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:46:39,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 07:46:39,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 07:46:39,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 07:46:39,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:46:39,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:46:39,937 INFO L130 BoogieDeclarations]: Found specification of procedure append [2024-11-09 07:46:39,937 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2024-11-09 07:46:40,027 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:46:40,029 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:46:40,381 INFO L? ?]: Removed 128 outVars from TransFormulas that were not future-live. [2024-11-09 07:46:40,381 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:46:40,396 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:46:40,398 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-09 07:46:40,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:46:40 BoogieIcfgContainer [2024-11-09 07:46:40,398 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:46:40,401 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:46:40,402 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:46:40,405 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:46:40,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:46:39" (1/3) ... [2024-11-09 07:46:40,407 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c1e65c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:46:40, skipping insertion in model container [2024-11-09 07:46:40,407 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:46:39" (2/3) ... [2024-11-09 07:46:40,407 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c1e65c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:46:40, skipping insertion in model container [2024-11-09 07:46:40,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:46:40" (3/3) ... [2024-11-09 07:46:40,409 INFO L112 eAbstractionObserver]: Analyzing ICFG length_test03-1.i [2024-11-09 07:46:40,424 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:46:40,425 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 59 error locations. [2024-11-09 07:46:40,481 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:46:40,491 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=None, 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;@65467674, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:46:40,491 INFO L334 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2024-11-09 07:46:40,496 INFO L276 IsEmpty]: Start isEmpty. Operand has 130 states, 67 states have (on average 2.029850746268657) internal successors, (136), 126 states have internal predecessors, (136), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:46:40,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 07:46:40,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:46:40,502 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 07:46:40,504 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:46:40,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:46:40,510 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2024-11-09 07:46:40,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:46:40,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228151837] [2024-11-09 07:46:40,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:40,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:46:40,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:40,705 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-09 07:46:40,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:46:40,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228151837] [2024-11-09 07:46:40,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228151837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:46:40,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:46:40,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:46:40,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268577933] [2024-11-09 07:46:40,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:46:40,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:46:40,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:46:40,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:46:40,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:46:40,777 INFO L87 Difference]: Start difference. First operand has 130 states, 67 states have (on average 2.029850746268657) internal successors, (136), 126 states have internal predecessors, (136), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-09 07:46:40,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:46:40,983 INFO L93 Difference]: Finished difference Result 167 states and 176 transitions. [2024-11-09 07:46:40,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:46:40,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-09 07:46:40,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:46:40,995 INFO L225 Difference]: With dead ends: 167 [2024-11-09 07:46:40,997 INFO L226 Difference]: Without dead ends: 165 [2024-11-09 07:46:40,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:46:41,003 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 51 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:46:41,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 172 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:46:41,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-09 07:46:41,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 126. [2024-11-09 07:46:41,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 66 states have (on average 1.9393939393939394) internal successors, (128), 122 states have internal predecessors, (128), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:46:41,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 132 transitions. [2024-11-09 07:46:41,041 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 132 transitions. Word has length 3 [2024-11-09 07:46:41,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:46:41,042 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 132 transitions. [2024-11-09 07:46:41,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-09 07:46:41,042 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 132 transitions. [2024-11-09 07:46:41,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 07:46:41,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:46:41,042 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 07:46:41,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:46:41,043 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:46:41,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:46:41,044 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2024-11-09 07:46:41,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:46:41,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685443004] [2024-11-09 07:46:41,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:41,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:46:41,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:41,153 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-09 07:46:41,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:46:41,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685443004] [2024-11-09 07:46:41,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685443004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:46:41,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:46:41,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:46:41,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40430342] [2024-11-09 07:46:41,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:46:41,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:46:41,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:46:41,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:46:41,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:46:41,162 INFO L87 Difference]: Start difference. First operand 126 states and 132 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-09 07:46:41,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:46:41,286 INFO L93 Difference]: Finished difference Result 126 states and 133 transitions. [2024-11-09 07:46:41,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:46:41,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-09 07:46:41,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:46:41,289 INFO L225 Difference]: With dead ends: 126 [2024-11-09 07:46:41,290 INFO L226 Difference]: Without dead ends: 126 [2024-11-09 07:46:41,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:46:41,292 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 10 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:46:41,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 193 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:46:41,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-09 07:46:41,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2024-11-09 07:46:41,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 66 states have (on average 1.9090909090909092) internal successors, (126), 120 states have internal predecessors, (126), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:46:41,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 130 transitions. [2024-11-09 07:46:41,305 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 130 transitions. Word has length 3 [2024-11-09 07:46:41,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:46:41,305 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 130 transitions. [2024-11-09 07:46:41,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-09 07:46:41,307 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions. [2024-11-09 07:46:41,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 07:46:41,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:46:41,307 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 07:46:41,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:46:41,308 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:46:41,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:46:41,308 INFO L85 PathProgramCache]: Analyzing trace with hash 889446152, now seen corresponding path program 1 times [2024-11-09 07:46:41,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:46:41,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205037975] [2024-11-09 07:46:41,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:41,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:46:41,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:41,415 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-09 07:46:41,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:46:41,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205037975] [2024-11-09 07:46:41,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205037975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:46:41,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:46:41,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:46:41,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853815441] [2024-11-09 07:46:41,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:46:41,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:46:41,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:46:41,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:46:41,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:46:41,422 INFO L87 Difference]: Start difference. First operand 124 states and 130 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-09 07:46:41,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:46:41,529 INFO L93 Difference]: Finished difference Result 140 states and 149 transitions. [2024-11-09 07:46:41,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:46:41,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-11-09 07:46:41,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:46:41,534 INFO L225 Difference]: With dead ends: 140 [2024-11-09 07:46:41,534 INFO L226 Difference]: Without dead ends: 140 [2024-11-09 07:46:41,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:46:41,535 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 24 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:46:41,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 177 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:46:41,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-09 07:46:41,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 127. [2024-11-09 07:46:41,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 71 states have (on average 1.8591549295774648) internal successors, (132), 123 states have internal predecessors, (132), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:46:41,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 136 transitions. [2024-11-09 07:46:41,552 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 136 transitions. Word has length 6 [2024-11-09 07:46:41,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:46:41,552 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 136 transitions. [2024-11-09 07:46:41,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-09 07:46:41,553 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 136 transitions. [2024-11-09 07:46:41,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 07:46:41,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:46:41,553 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 07:46:41,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:46:41,554 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:46:41,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:46:41,554 INFO L85 PathProgramCache]: Analyzing trace with hash 889446153, now seen corresponding path program 1 times [2024-11-09 07:46:41,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:46:41,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316145551] [2024-11-09 07:46:41,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:41,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:46:41,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:41,668 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-09 07:46:41,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:46:41,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316145551] [2024-11-09 07:46:41,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316145551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:46:41,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:46:41,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:46:41,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425433244] [2024-11-09 07:46:41,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:46:41,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:46:41,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:46:41,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:46:41,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:46:41,671 INFO L87 Difference]: Start difference. First operand 127 states and 136 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-09 07:46:41,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:46:41,747 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2024-11-09 07:46:41,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:46:41,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-11-09 07:46:41,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:46:41,748 INFO L225 Difference]: With dead ends: 127 [2024-11-09 07:46:41,748 INFO L226 Difference]: Without dead ends: 127 [2024-11-09 07:46:41,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:46:41,750 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 4 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:46:41,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 194 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:46:41,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-09 07:46:41,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2024-11-09 07:46:41,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 71 states have (on average 1.8309859154929577) internal successors, (130), 121 states have internal predecessors, (130), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:46:41,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 134 transitions. [2024-11-09 07:46:41,757 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 134 transitions. Word has length 6 [2024-11-09 07:46:41,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:46:41,757 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 134 transitions. [2024-11-09 07:46:41,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-09 07:46:41,758 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 134 transitions. [2024-11-09 07:46:41,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 07:46:41,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:46:41,758 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:46:41,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:46:41,759 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:46:41,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:46:41,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1036552302, now seen corresponding path program 1 times [2024-11-09 07:46:41,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:46:41,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630146562] [2024-11-09 07:46:41,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:41,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:46:41,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:41,858 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-09 07:46:41,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:46:41,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630146562] [2024-11-09 07:46:41,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630146562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:46:41,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:46:41,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:46:41,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44075483] [2024-11-09 07:46:41,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:46:41,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:46:41,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:46:41,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:46:41,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:46:41,861 INFO L87 Difference]: Start difference. First operand 125 states and 134 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:46:41,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:46:41,945 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2024-11-09 07:46:41,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:46:41,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-09 07:46:41,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:46:41,946 INFO L225 Difference]: With dead ends: 120 [2024-11-09 07:46:41,947 INFO L226 Difference]: Without dead ends: 120 [2024-11-09 07:46:41,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:46:41,948 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 35 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:46:41,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 145 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:46:41,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-09 07:46:41,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-09 07:46:41,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 71 states have (on average 1.7605633802816902) internal successors, (125), 116 states have internal predecessors, (125), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:46:41,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 129 transitions. [2024-11-09 07:46:41,962 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 129 transitions. Word has length 12 [2024-11-09 07:46:41,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:46:41,962 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 129 transitions. [2024-11-09 07:46:41,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:46:41,963 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 129 transitions. [2024-11-09 07:46:41,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 07:46:41,963 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:46:41,963 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:46:41,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:46:41,964 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:46:41,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:46:41,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1036552303, now seen corresponding path program 1 times [2024-11-09 07:46:41,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:46:41,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454657112] [2024-11-09 07:46:41,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:41,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:46:41,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:42,082 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-09 07:46:42,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:46:42,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454657112] [2024-11-09 07:46:42,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454657112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:46:42,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:46:42,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:46:42,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815310533] [2024-11-09 07:46:42,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:46:42,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:46:42,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:46:42,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:46:42,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:46:42,084 INFO L87 Difference]: Start difference. First operand 120 states and 129 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:46:42,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:46:42,149 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2024-11-09 07:46:42,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:46:42,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-09 07:46:42,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:46:42,153 INFO L225 Difference]: With dead ends: 115 [2024-11-09 07:46:42,154 INFO L226 Difference]: Without dead ends: 115 [2024-11-09 07:46:42,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:46:42,156 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 35 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:46:42,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 154 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:46:42,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-09 07:46:42,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-09 07:46:42,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 71 states have (on average 1.6901408450704225) internal successors, (120), 111 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:46:42,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2024-11-09 07:46:42,169 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 12 [2024-11-09 07:46:42,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:46:42,170 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2024-11-09 07:46:42,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:46:42,170 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2024-11-09 07:46:42,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 07:46:42,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:46:42,171 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:46:42,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:46:42,171 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:46:42,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:46:42,172 INFO L85 PathProgramCache]: Analyzing trace with hash 2068350391, now seen corresponding path program 1 times [2024-11-09 07:46:42,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:46:42,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101637868] [2024-11-09 07:46:42,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:42,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:46:42,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:42,483 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-09 07:46:42,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:46:42,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101637868] [2024-11-09 07:46:42,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101637868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:46:42,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:46:42,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:46:42,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319837704] [2024-11-09 07:46:42,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:46:42,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:46:42,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:46:42,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:46:42,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:46:42,486 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:46:42,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:46:42,733 INFO L93 Difference]: Finished difference Result 221 states and 242 transitions. [2024-11-09 07:46:42,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:46:42,734 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 07:46:42,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:46:42,735 INFO L225 Difference]: With dead ends: 221 [2024-11-09 07:46:42,735 INFO L226 Difference]: Without dead ends: 221 [2024-11-09 07:46:42,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:46:42,736 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 240 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:46:42,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 220 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:46:42,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-09 07:46:42,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 149. [2024-11-09 07:46:42,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 110 states have (on average 1.6181818181818182) internal successors, (178), 144 states have internal predecessors, (178), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:46:42,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 182 transitions. [2024-11-09 07:46:42,747 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 182 transitions. Word has length 13 [2024-11-09 07:46:42,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:46:42,751 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 182 transitions. [2024-11-09 07:46:42,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:46:42,752 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 182 transitions. [2024-11-09 07:46:42,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 07:46:42,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:46:42,753 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:46:42,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:46:42,753 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:46:42,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:46:42,754 INFO L85 PathProgramCache]: Analyzing trace with hash 2068350392, now seen corresponding path program 1 times [2024-11-09 07:46:42,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:46:42,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768340177] [2024-11-09 07:46:42,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:42,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:46:42,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:43,003 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-09 07:46:43,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:46:43,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768340177] [2024-11-09 07:46:43,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768340177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:46:43,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:46:43,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:46:43,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735971671] [2024-11-09 07:46:43,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:46:43,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:46:43,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:46:43,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:46:43,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:46:43,005 INFO L87 Difference]: Start difference. First operand 149 states and 182 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:46:43,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:46:43,213 INFO L93 Difference]: Finished difference Result 171 states and 207 transitions. [2024-11-09 07:46:43,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:46:43,213 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 07:46:43,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:46:43,214 INFO L225 Difference]: With dead ends: 171 [2024-11-09 07:46:43,215 INFO L226 Difference]: Without dead ends: 171 [2024-11-09 07:46:43,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:46:43,217 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 25 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:46:43,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 330 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:46:43,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-09 07:46:43,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2024-11-09 07:46:43,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 129 states have (on average 1.558139534883721) internal successors, (201), 163 states have internal predecessors, (201), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:46:43,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 207 transitions. [2024-11-09 07:46:43,227 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 207 transitions. Word has length 13 [2024-11-09 07:46:43,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:46:43,228 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 207 transitions. [2024-11-09 07:46:43,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:46:43,229 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 207 transitions. [2024-11-09 07:46:43,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 07:46:43,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:46:43,230 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:46:43,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 07:46:43,230 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:46:43,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:46:43,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1480883050, now seen corresponding path program 1 times [2024-11-09 07:46:43,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:46:43,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586717121] [2024-11-09 07:46:43,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:43,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:46:43,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:43,773 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-09 07:46:43,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:46:43,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586717121] [2024-11-09 07:46:43,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586717121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:46:43,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:46:43,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 07:46:43,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300010794] [2024-11-09 07:46:43,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:46:43,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:46:43,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:46:43,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:46:43,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:46:43,777 INFO L87 Difference]: Start difference. First operand 169 states and 207 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:46:44,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:46:44,004 INFO L93 Difference]: Finished difference Result 171 states and 206 transitions. [2024-11-09 07:46:44,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:46:44,004 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-09 07:46:44,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:46:44,005 INFO L225 Difference]: With dead ends: 171 [2024-11-09 07:46:44,005 INFO L226 Difference]: Without dead ends: 171 [2024-11-09 07:46:44,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:46:44,006 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 38 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:46:44,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 676 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:46:44,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-09 07:46:44,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2024-11-09 07:46:44,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 129 states have (on average 1.550387596899225) internal successors, (200), 163 states have internal predecessors, (200), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:46:44,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 206 transitions. [2024-11-09 07:46:44,011 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 206 transitions. Word has length 22 [2024-11-09 07:46:44,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:46:44,013 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 206 transitions. [2024-11-09 07:46:44,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:46:44,013 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 206 transitions. [2024-11-09 07:46:44,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 07:46:44,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:46:44,014 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:46:44,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:46:44,015 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:46:44,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:46:44,015 INFO L85 PathProgramCache]: Analyzing trace with hash -439263795, now seen corresponding path program 1 times [2024-11-09 07:46:44,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:46:44,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734873016] [2024-11-09 07:46:44,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:44,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:46:44,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:44,461 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-09 07:46:44,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:46:44,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734873016] [2024-11-09 07:46:44,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734873016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:46:44,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:46:44,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 07:46:44,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012973626] [2024-11-09 07:46:44,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:46:44,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 07:46:44,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:46:44,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 07:46:44,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:46:44,464 INFO L87 Difference]: Start difference. First operand 169 states and 206 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:46:44,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:46:44,746 INFO L93 Difference]: Finished difference Result 196 states and 231 transitions. [2024-11-09 07:46:44,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:46:44,747 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-09 07:46:44,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:46:44,747 INFO L225 Difference]: With dead ends: 196 [2024-11-09 07:46:44,747 INFO L226 Difference]: Without dead ends: 196 [2024-11-09 07:46:44,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-09 07:46:44,748 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 113 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:46:44,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 509 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:46:44,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-09 07:46:44,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 160. [2024-11-09 07:46:44,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 121 states have (on average 1.5454545454545454) internal successors, (187), 154 states have internal predecessors, (187), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:46:44,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 193 transitions. [2024-11-09 07:46:44,756 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 193 transitions. Word has length 24 [2024-11-09 07:46:44,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:46:44,756 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 193 transitions. [2024-11-09 07:46:44,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:46:44,756 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 193 transitions. [2024-11-09 07:46:44,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 07:46:44,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:46:44,757 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:46:44,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 07:46:44,757 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:46:44,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:46:44,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1442887251, now seen corresponding path program 1 times [2024-11-09 07:46:44,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:46:44,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936834129] [2024-11-09 07:46:44,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:44,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:46:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:44,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 07:46:44,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:44,849 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-09 07:46:44,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:46:44,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936834129] [2024-11-09 07:46:44,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936834129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:46:44,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:46:44,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:46:44,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916513145] [2024-11-09 07:46:44,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:46:44,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:46:44,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:46:44,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:46:44,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:46:44,853 INFO L87 Difference]: Start difference. First operand 160 states and 193 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:46:44,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:46:44,941 INFO L93 Difference]: Finished difference Result 153 states and 171 transitions. [2024-11-09 07:46:44,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:46:44,941 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2024-11-09 07:46:44,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:46:44,942 INFO L225 Difference]: With dead ends: 153 [2024-11-09 07:46:44,943 INFO L226 Difference]: Without dead ends: 153 [2024-11-09 07:46:44,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-09 07:46:44,943 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 13 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:46:44,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 248 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:46:44,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-09 07:46:44,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 139. [2024-11-09 07:46:44,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 100 states have (on average 1.5) internal successors, (150), 133 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:46:44,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 156 transitions. [2024-11-09 07:46:44,948 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 156 transitions. Word has length 30 [2024-11-09 07:46:44,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:46:44,948 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 156 transitions. [2024-11-09 07:46:44,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:46:44,948 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 156 transitions. [2024-11-09 07:46:44,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 07:46:44,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:46:44,949 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:46:44,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 07:46:44,950 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:46:44,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:46:44,950 INFO L85 PathProgramCache]: Analyzing trace with hash -610198618, now seen corresponding path program 1 times [2024-11-09 07:46:44,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:46:44,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411180862] [2024-11-09 07:46:44,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:44,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:46:44,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:45,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 07:46:45,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:45,429 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:45,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:46:45,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411180862] [2024-11-09 07:46:45,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411180862] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:46:45,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098461104] [2024-11-09 07:46:45,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:45,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:46:45,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:46:45,433 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-09 07:46:45,434 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-09 07:46:45,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:45,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 07:46:45,584 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:46:45,780 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:46:45,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-09 07:46:45,825 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:45,825 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:46:46,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2024-11-09 07:46:46,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:46:46,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2024-11-09 07:46:46,630 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:46,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098461104] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:46:46,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:46:46,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 21 [2024-11-09 07:46:46,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749767346] [2024-11-09 07:46:46,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:46:46,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 07:46:46,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:46:46,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 07:46:46,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2024-11-09 07:46:46,632 INFO L87 Difference]: Start difference. First operand 139 states and 156 transitions. Second operand has 22 states, 21 states have (on average 3.6666666666666665) internal successors, (77), 18 states have internal predecessors, (77), 5 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 07:46:47,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:46:47,362 INFO L93 Difference]: Finished difference Result 147 states and 157 transitions. [2024-11-09 07:46:47,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 07:46:47,363 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.6666666666666665) internal successors, (77), 18 states have internal predecessors, (77), 5 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2024-11-09 07:46:47,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:46:47,364 INFO L225 Difference]: With dead ends: 147 [2024-11-09 07:46:47,365 INFO L226 Difference]: Without dead ends: 147 [2024-11-09 07:46:47,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 45 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=131, Invalid=625, Unknown=0, NotChecked=0, Total=756 [2024-11-09 07:46:47,366 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 330 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:46:47,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 651 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 07:46:47,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-09 07:46:47,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 136. [2024-11-09 07:46:47,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 98 states have (on average 1.4285714285714286) internal successors, (140), 130 states have internal predecessors, (140), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:46:47,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 146 transitions. [2024-11-09 07:46:47,371 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 146 transitions. Word has length 32 [2024-11-09 07:46:47,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:46:47,372 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 146 transitions. [2024-11-09 07:46:47,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.6666666666666665) internal successors, (77), 18 states have internal predecessors, (77), 5 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 07:46:47,372 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 146 transitions. [2024-11-09 07:46:47,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 07:46:47,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:46:47,375 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:46:47,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 07:46:47,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-09 07:46:47,576 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:46:47,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:46:47,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1027331565, now seen corresponding path program 1 times [2024-11-09 07:46:47,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:46:47,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524502545] [2024-11-09 07:46:47,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:47,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:46:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:47,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 07:46:47,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:47,865 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:47,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:46:47,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524502545] [2024-11-09 07:46:47,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524502545] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:46:47,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181550379] [2024-11-09 07:46:47,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:47,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:46:47,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:46:47,868 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:46:47,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 07:46:48,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:48,004 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 07:46:48,006 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:46:48,010 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-09 07:46:48,034 WARN L873 $PredicateComparison]: unable to prove that (exists ((append_~node~0.base Int)) (and (= (select |c_old(#valid)| append_~node~0.base) 0) (= |c_#valid| (store |c_old(#valid)| append_~node~0.base (select |c_#valid| append_~node~0.base))))) is different from true [2024-11-09 07:46:48,110 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 07:46:48,111 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 19 treesize of output 16 [2024-11-09 07:46:48,134 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 07:46:48,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-09 07:46:48,147 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 07:46:48,147 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:46:48,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181550379] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:46:48,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:46:48,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 10 [2024-11-09 07:46:48,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699056944] [2024-11-09 07:46:48,210 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:46:48,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 07:46:48,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:46:48,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 07:46:48,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=86, Unknown=1, NotChecked=18, Total=132 [2024-11-09 07:46:48,212 INFO L87 Difference]: Start difference. First operand 136 states and 146 transitions. Second operand has 11 states, 10 states have (on average 4.7) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:46:48,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:46:48,644 INFO L93 Difference]: Finished difference Result 169 states and 182 transitions. [2024-11-09 07:46:48,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 07:46:48,644 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2024-11-09 07:46:48,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:46:48,646 INFO L225 Difference]: With dead ends: 169 [2024-11-09 07:46:48,646 INFO L226 Difference]: Without dead ends: 169 [2024-11-09 07:46:48,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=283, Unknown=1, NotChecked=36, Total=420 [2024-11-09 07:46:48,647 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 139 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 145 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:46:48,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 300 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 322 Invalid, 0 Unknown, 145 Unchecked, 0.2s Time] [2024-11-09 07:46:48,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-09 07:46:48,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 139. [2024-11-09 07:46:48,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 101 states have (on average 1.4257425742574257) internal successors, (144), 133 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:46:48,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 151 transitions. [2024-11-09 07:46:48,652 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 151 transitions. Word has length 33 [2024-11-09 07:46:48,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:46:48,652 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 151 transitions. [2024-11-09 07:46:48,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:46:48,652 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 151 transitions. [2024-11-09 07:46:48,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 07:46:48,653 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:46:48,653 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:46:48,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 07:46:48,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-09 07:46:48,853 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:46:48,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:46:48,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1027331566, now seen corresponding path program 1 times [2024-11-09 07:46:48,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:46:48,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485095404] [2024-11-09 07:46:48,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:48,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:46:48,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:49,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 07:46:49,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:49,225 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:49,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:46:49,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485095404] [2024-11-09 07:46:49,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485095404] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:46:49,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086681396] [2024-11-09 07:46:49,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:49,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:46:49,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:46:49,229 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:46:49,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 07:46:49,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:49,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 07:46:49,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:46:49,394 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-09 07:46:49,398 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 1 [2024-11-09 07:46:49,457 WARN L873 $PredicateComparison]: unable to prove that (exists ((append_~node~0.base Int)) (and (= (store |c_old(#length)| append_~node~0.base (select |c_#length| append_~node~0.base)) |c_#length|) (= (select |c_old(#valid)| append_~node~0.base) 0))) is different from true [2024-11-09 07:46:49,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:46:49,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:46:49,526 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:46:49,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:46:49,585 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:46:49,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-09 07:46:49,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 07:46:49,616 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:46:49,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086681396] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:46:49,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:46:49,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2024-11-09 07:46:49,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535975323] [2024-11-09 07:46:49,876 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:46:49,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 07:46:49,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:46:49,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 07:46:49,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=253, Unknown=1, NotChecked=32, Total=342 [2024-11-09 07:46:49,877 INFO L87 Difference]: Start difference. First operand 139 states and 151 transitions. Second operand has 15 states, 14 states have (on average 4.0) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:46:50,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:46:50,458 INFO L93 Difference]: Finished difference Result 232 states and 256 transitions. [2024-11-09 07:46:50,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 07:46:50,459 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2024-11-09 07:46:50,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:46:50,460 INFO L225 Difference]: With dead ends: 232 [2024-11-09 07:46:50,460 INFO L226 Difference]: Without dead ends: 232 [2024-11-09 07:46:50,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=491, Unknown=1, NotChecked=46, Total=650 [2024-11-09 07:46:50,461 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 151 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 186 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:46:50,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 488 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 495 Invalid, 0 Unknown, 186 Unchecked, 0.4s Time] [2024-11-09 07:46:50,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-09 07:46:50,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 196. [2024-11-09 07:46:50,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 156 states have (on average 1.4423076923076923) internal successors, (225), 187 states have internal predecessors, (225), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-09 07:46:50,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 234 transitions. [2024-11-09 07:46:50,467 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 234 transitions. Word has length 33 [2024-11-09 07:46:50,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:46:50,468 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 234 transitions. [2024-11-09 07:46:50,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:46:50,468 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 234 transitions. [2024-11-09 07:46:50,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 07:46:50,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:46:50,469 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:46:50,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 07:46:50,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:46:50,670 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:46:50,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:46:50,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1240813252, now seen corresponding path program 1 times [2024-11-09 07:46:50,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:46:50,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892161487] [2024-11-09 07:46:50,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:50,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:46:50,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:51,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 07:46:51,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:51,596 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:51,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:46:51,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892161487] [2024-11-09 07:46:51,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892161487] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:46:51,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531371208] [2024-11-09 07:46:51,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:51,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:46:51,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:46:51,600 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:46:51,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 07:46:51,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:51,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-09 07:46:51,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:46:51,765 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 1 [2024-11-09 07:46:51,768 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-09 07:46:51,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 07:46:51,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 07:46:52,045 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2024-11-09 07:46:52,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2024-11-09 07:46:52,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-09 07:46:52,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-09 07:46:52,125 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:52,126 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:46:52,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 70 [2024-11-09 07:46:52,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 94 [2024-11-09 07:46:52,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2024-11-09 07:46:52,832 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:52,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531371208] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:46:52,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:46:52,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 21 [2024-11-09 07:46:52,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213169630] [2024-11-09 07:46:52,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:46:52,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 07:46:52,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:46:52,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 07:46:52,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2024-11-09 07:46:52,834 INFO L87 Difference]: Start difference. First operand 196 states and 234 transitions. Second operand has 22 states, 21 states have (on average 4.904761904761905) internal successors, (103), 20 states have internal predecessors, (103), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 07:46:53,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:46:53,609 INFO L93 Difference]: Finished difference Result 205 states and 242 transitions. [2024-11-09 07:46:53,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 07:46:53,610 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 4.904761904761905) internal successors, (103), 20 states have internal predecessors, (103), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2024-11-09 07:46:53,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:46:53,612 INFO L225 Difference]: With dead ends: 205 [2024-11-09 07:46:53,612 INFO L226 Difference]: Without dead ends: 205 [2024-11-09 07:46:53,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=132, Invalid=680, Unknown=0, NotChecked=0, Total=812 [2024-11-09 07:46:53,614 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 186 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:46:53,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 702 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 07:46:53,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-09 07:46:53,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 200. [2024-11-09 07:46:53,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 160 states have (on average 1.425) internal successors, (228), 191 states have internal predecessors, (228), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 07:46:53,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 236 transitions. [2024-11-09 07:46:53,622 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 236 transitions. Word has length 41 [2024-11-09 07:46:53,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:46:53,623 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 236 transitions. [2024-11-09 07:46:53,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 4.904761904761905) internal successors, (103), 20 states have internal predecessors, (103), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 07:46:53,623 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 236 transitions. [2024-11-09 07:46:53,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 07:46:53,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:46:53,625 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:46:53,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 07:46:53,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-09 07:46:53,830 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:46:53,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:46:53,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1240813253, now seen corresponding path program 1 times [2024-11-09 07:46:53,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:46:53,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466042856] [2024-11-09 07:46:53,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:53,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:46:53,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:54,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 07:46:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:54,419 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:54,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:46:54,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466042856] [2024-11-09 07:46:54,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466042856] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:46:54,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457045161] [2024-11-09 07:46:54,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:54,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:46:54,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:46:54,422 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:46:54,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 07:46:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:54,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-09 07:46:54,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:46:54,592 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-09 07:46:54,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 07:46:54,710 INFO L349 Elim1Store]: treesize reduction 38, result has 36.7 percent of original size [2024-11-09 07:46:54,711 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 28 [2024-11-09 07:46:54,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-09 07:46:54,745 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:54,746 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:46:54,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2024-11-09 07:46:55,327 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:55,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457045161] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:46:55,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:46:55,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 19 [2024-11-09 07:46:55,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041732584] [2024-11-09 07:46:55,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:46:55,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 07:46:55,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:46:55,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 07:46:55,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2024-11-09 07:46:55,329 INFO L87 Difference]: Start difference. First operand 200 states and 236 transitions. Second operand has 20 states, 19 states have (on average 4.842105263157895) internal successors, (92), 18 states have internal predecessors, (92), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 07:46:55,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:46:55,929 INFO L93 Difference]: Finished difference Result 202 states and 239 transitions. [2024-11-09 07:46:55,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:46:55,929 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.842105263157895) internal successors, (92), 18 states have internal predecessors, (92), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2024-11-09 07:46:55,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:46:55,932 INFO L225 Difference]: With dead ends: 202 [2024-11-09 07:46:55,932 INFO L226 Difference]: Without dead ends: 202 [2024-11-09 07:46:55,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2024-11-09 07:46:55,933 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 143 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:46:55,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 857 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 855 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 07:46:55,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-09 07:46:55,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2024-11-09 07:46:55,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 160 states have (on average 1.41875) internal successors, (227), 191 states have internal predecessors, (227), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 07:46:55,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 235 transitions. [2024-11-09 07:46:55,939 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 235 transitions. Word has length 41 [2024-11-09 07:46:55,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:46:55,940 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 235 transitions. [2024-11-09 07:46:55,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.842105263157895) internal successors, (92), 18 states have internal predecessors, (92), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 07:46:55,940 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 235 transitions. [2024-11-09 07:46:55,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 07:46:55,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:46:55,942 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:46:55,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 07:46:56,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-09 07:46:56,143 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:46:56,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:46:56,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1836513292, now seen corresponding path program 1 times [2024-11-09 07:46:56,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:46:56,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761242358] [2024-11-09 07:46:56,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:56,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:46:56,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:56,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 07:46:56,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:56,805 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:56,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:46:56,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761242358] [2024-11-09 07:46:56,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761242358] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:46:56,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782349719] [2024-11-09 07:46:56,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:56,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:46:56,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:46:56,808 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:46:56,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 07:46:56,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:56,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-09 07:46:56,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:46:56,993 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-09 07:46:57,003 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:46:57,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:46:57,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:46:57,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:46:57,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-09 07:46:57,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-09 07:46:57,331 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:57,332 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:46:57,407 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1487 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1487) |c_ULTIMATE.start_main_~list2~0#1.base|) |c_ULTIMATE.start_main_~list2~0#1.offset|) 0)) (forall ((v_ArrVal_1488 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1488) |c_ULTIMATE.start_main_~list2~0#1.base|) |c_ULTIMATE.start_main_~list2~0#1.offset|) 0))) is different from false [2024-11-09 07:46:57,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782349719] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:46:57,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:46:57,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 19 [2024-11-09 07:46:57,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075545908] [2024-11-09 07:46:57,409 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:46:57,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 07:46:57,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:46:57,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 07:46:57,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=292, Unknown=1, NotChecked=34, Total=380 [2024-11-09 07:46:57,411 INFO L87 Difference]: Start difference. First operand 200 states and 235 transitions. Second operand has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 15 states have internal predecessors, (53), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:46:57,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:46:57,968 INFO L93 Difference]: Finished difference Result 284 states and 336 transitions. [2024-11-09 07:46:57,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 07:46:57,969 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 15 states have internal predecessors, (53), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 42 [2024-11-09 07:46:57,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:46:57,972 INFO L225 Difference]: With dead ends: 284 [2024-11-09 07:46:57,972 INFO L226 Difference]: Without dead ends: 284 [2024-11-09 07:46:57,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=580, Unknown=1, NotChecked=50, Total=756 [2024-11-09 07:46:57,973 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 206 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:46:57,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 863 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:46:57,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-09 07:46:57,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 212. [2024-11-09 07:46:57,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 170 states have (on average 1.4) internal successors, (238), 201 states have internal predecessors, (238), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 07:46:57,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 250 transitions. [2024-11-09 07:46:57,980 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 250 transitions. Word has length 42 [2024-11-09 07:46:57,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:46:57,981 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 250 transitions. [2024-11-09 07:46:57,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 15 states have internal predecessors, (53), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:46:57,981 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 250 transitions. [2024-11-09 07:46:57,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 07:46:57,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:46:57,982 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:46:57,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 07:46:58,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-09 07:46:58,187 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:46:58,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:46:58,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1591414825, now seen corresponding path program 1 times [2024-11-09 07:46:58,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:46:58,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436550775] [2024-11-09 07:46:58,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:58,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:46:58,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:59,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 07:46:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:59,231 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:46:59,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:46:59,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436550775] [2024-11-09 07:46:59,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436550775] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:46:59,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817097748] [2024-11-09 07:46:59,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:46:59,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:46:59,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:46:59,235 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:46:59,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 07:46:59,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:46:59,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-09 07:46:59,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:46:59,445 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-09 07:46:59,471 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:46:59,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:46:59,495 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 13 treesize of output 9 [2024-11-09 07:46:59,501 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 13 treesize of output 9 [2024-11-09 07:47:03,731 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~list2~0#1.offset| 4))) (and (or (exists ((|v_#memory_$Pointer$#1.base_BEFORE_CALL_7| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_7| |c_#memory_$Pointer$#1.base|))) (and (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_7| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse0) 0) (not (= |c_ULTIMATE.start_main_~list2~0#1.base| .cse1)) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_7| .cse1 (select |c_#memory_$Pointer$#1.base| .cse1)) |c_#memory_$Pointer$#1.base|)))) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse0) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse0) 0))) is different from false [2024-11-09 07:47:03,740 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~list2~0#1.offset| 4))) (and (or (exists ((|v_#memory_$Pointer$#1.base_BEFORE_CALL_7| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_7| |c_#memory_$Pointer$#1.base|))) (and (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_7| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse0) 0) (not (= |c_ULTIMATE.start_main_~list2~0#1.base| .cse1)) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_7| .cse1 (select |c_#memory_$Pointer$#1.base| .cse1)) |c_#memory_$Pointer$#1.base|)))) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse0) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse0) 0))) is different from true [2024-11-09 07:47:03,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 07:47:03,905 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:47:03,905 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:47:04,021 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~list2~0#1.offset| 4))) (and (forall ((v_ArrVal_1695 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1695) |c_ULTIMATE.start_main_~list2~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_1696 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1696) |c_ULTIMATE.start_main_~list2~0#1.base|) .cse0) 0)))) is different from false [2024-11-09 07:47:04,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817097748] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:47:04,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:47:04,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2024-11-09 07:47:04,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37421960] [2024-11-09 07:47:04,024 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:47:04,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-09 07:47:04,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:47:04,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-09 07:47:04,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=576, Unknown=3, NotChecked=98, Total=756 [2024-11-09 07:47:04,026 INFO L87 Difference]: Start difference. First operand 212 states and 250 transitions. Second operand has 25 states, 25 states have (on average 2.52) internal successors, (63), 20 states have internal predecessors, (63), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:47:08,210 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~list2~0#1.offset| 4)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list2~0#1.base|))) (and (= (select .cse0 4) 0) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (or (exists ((|v_#memory_$Pointer$#1.base_BEFORE_CALL_7| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_7| |c_#memory_$Pointer$#1.base|))) (and (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_7| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse1) 0) (not (= |c_ULTIMATE.start_main_~list2~0#1.base| .cse2)) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_7| .cse2 (select |c_#memory_$Pointer$#1.base| .cse2)) |c_#memory_$Pointer$#1.base|)))) (= (select .cse0 .cse1) 0)) (= |c_ULTIMATE.start_main_~list2~0#1.offset| 0) (= (select .cse3 .cse1) 0) (= (select .cse3 4) 0) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|)))) is different from false [2024-11-09 07:47:08,212 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~list2~0#1.offset| 4)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list2~0#1.base|))) (and (= (select .cse0 4) 0) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (or (exists ((|v_#memory_$Pointer$#1.base_BEFORE_CALL_7| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_7| |c_#memory_$Pointer$#1.base|))) (and (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_7| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse1) 0) (not (= |c_ULTIMATE.start_main_~list2~0#1.base| .cse2)) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_7| .cse2 (select |c_#memory_$Pointer$#1.base| .cse2)) |c_#memory_$Pointer$#1.base|)))) (= (select .cse0 .cse1) 0)) (= |c_ULTIMATE.start_main_~list2~0#1.offset| 0) (= (select .cse3 .cse1) 0) (= (select .cse3 4) 0) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|)))) is different from true [2024-11-09 07:47:08,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:47:08,630 INFO L93 Difference]: Finished difference Result 260 states and 310 transitions. [2024-11-09 07:47:08,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 07:47:08,631 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.52) internal successors, (63), 20 states have internal predecessors, (63), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2024-11-09 07:47:08,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:47:08,632 INFO L225 Difference]: With dead ends: 260 [2024-11-09 07:47:08,632 INFO L226 Difference]: Without dead ends: 260 [2024-11-09 07:47:08,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=156, Invalid=907, Unknown=5, NotChecked=192, Total=1260 [2024-11-09 07:47:08,633 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 94 mSDsluCounter, 998 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 181 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:47:08,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 1074 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 756 Invalid, 0 Unknown, 181 Unchecked, 0.4s Time] [2024-11-09 07:47:08,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-09 07:47:08,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 215. [2024-11-09 07:47:08,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 173 states have (on average 1.393063583815029) internal successors, (241), 204 states have internal predecessors, (241), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 07:47:08,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 253 transitions. [2024-11-09 07:47:08,639 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 253 transitions. Word has length 44 [2024-11-09 07:47:08,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:47:08,640 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 253 transitions. [2024-11-09 07:47:08,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.52) internal successors, (63), 20 states have internal predecessors, (63), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:47:08,640 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 253 transitions. [2024-11-09 07:47:08,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-09 07:47:08,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:47:08,641 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:47:08,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-09 07:47:08,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:47:08,845 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:47:08,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:47:08,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1452710056, now seen corresponding path program 1 times [2024-11-09 07:47:08,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:47:08,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198053004] [2024-11-09 07:47:08,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:47:08,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:47:08,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:47:08,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 07:47:08,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:47:08,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 07:47:08,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:47:08,974 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 07:47:08,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:47:08,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198053004] [2024-11-09 07:47:08,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198053004] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:47:08,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813284963] [2024-11-09 07:47:08,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:47:08,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:47:08,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:47:08,977 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:47:08,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 07:47:09,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:47:09,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 07:47:09,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:47:09,196 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 07:47:09,196 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:47:09,223 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 07:47:09,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813284963] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:47:09,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:47:09,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2024-11-09 07:47:09,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789925717] [2024-11-09 07:47:09,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:47:09,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:47:09,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:47:09,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:47:09,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:47:09,225 INFO L87 Difference]: Start difference. First operand 215 states and 253 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 07:47:09,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:47:09,347 INFO L93 Difference]: Finished difference Result 294 states and 351 transitions. [2024-11-09 07:47:09,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:47:09,348 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 48 [2024-11-09 07:47:09,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:47:09,349 INFO L225 Difference]: With dead ends: 294 [2024-11-09 07:47:09,349 INFO L226 Difference]: Without dead ends: 294 [2024-11-09 07:47:09,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:47:09,350 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 81 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:47:09,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 361 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:47:09,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-09 07:47:09,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 279. [2024-11-09 07:47:09,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 233 states have (on average 1.4206008583690988) internal successors, (331), 262 states have internal predecessors, (331), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 07:47:09,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 351 transitions. [2024-11-09 07:47:09,357 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 351 transitions. Word has length 48 [2024-11-09 07:47:09,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:47:09,358 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 351 transitions. [2024-11-09 07:47:09,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 07:47:09,358 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 351 transitions. [2024-11-09 07:47:09,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 07:47:09,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:47:09,359 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:47:09,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-09 07:47:09,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:47:09,560 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:47:09,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:47:09,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1487400799, now seen corresponding path program 1 times [2024-11-09 07:47:09,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:47:09,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825536811] [2024-11-09 07:47:09,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:47:09,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:47:09,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:47:09,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 07:47:09,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:47:09,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 07:47:09,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:47:09,652 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 07:47:09,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:47:09,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825536811] [2024-11-09 07:47:09,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825536811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:47:09,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:47:09,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:47:09,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368731320] [2024-11-09 07:47:09,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:47:09,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:47:09,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:47:09,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:47:09,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:47:09,654 INFO L87 Difference]: Start difference. First operand 279 states and 351 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:47:09,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:47:09,734 INFO L93 Difference]: Finished difference Result 282 states and 354 transitions. [2024-11-09 07:47:09,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:47:09,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2024-11-09 07:47:09,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:47:09,736 INFO L225 Difference]: With dead ends: 282 [2024-11-09 07:47:09,736 INFO L226 Difference]: Without dead ends: 282 [2024-11-09 07:47:09,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 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-09 07:47:09,737 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:47:09,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 253 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:47:09,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-09 07:47:09,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2024-11-09 07:47:09,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 236 states have (on average 1.4152542372881356) internal successors, (334), 265 states have internal predecessors, (334), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 07:47:09,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 354 transitions. [2024-11-09 07:47:09,747 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 354 transitions. Word has length 50 [2024-11-09 07:47:09,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:47:09,747 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 354 transitions. [2024-11-09 07:47:09,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:47:09,748 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 354 transitions. [2024-11-09 07:47:09,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 07:47:09,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:47:09,749 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:47:09,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 07:47:09,750 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:47:09,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:47:09,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1096013604, now seen corresponding path program 1 times [2024-11-09 07:47:09,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:47:09,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307601906] [2024-11-09 07:47:09,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:47:09,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:47:09,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:47:10,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 07:47:10,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:47:10,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 07:47:10,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:47:10,278 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:47:10,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:47:10,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307601906] [2024-11-09 07:47:10,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307601906] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:47:10,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611618089] [2024-11-09 07:47:10,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:47:10,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:47:10,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:47:10,281 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:47:10,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 07:47:10,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:47:10,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 07:47:10,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:47:10,556 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 19 treesize of output 1 [2024-11-09 07:47:10,686 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:47:10,687 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:47:10,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2024-11-09 07:47:10,900 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:47:10,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611618089] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:47:10,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:47:10,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 22 [2024-11-09 07:47:10,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584030210] [2024-11-09 07:47:10,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:47:10,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 07:47:10,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:47:10,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 07:47:10,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2024-11-09 07:47:10,903 INFO L87 Difference]: Start difference. First operand 282 states and 354 transitions. Second operand has 22 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 19 states have internal predecessors, (76), 4 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:47:11,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:47:11,483 INFO L93 Difference]: Finished difference Result 304 states and 385 transitions. [2024-11-09 07:47:11,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-09 07:47:11,483 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 19 states have internal predecessors, (76), 4 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 52 [2024-11-09 07:47:11,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:47:11,485 INFO L225 Difference]: With dead ends: 304 [2024-11-09 07:47:11,485 INFO L226 Difference]: Without dead ends: 304 [2024-11-09 07:47:11,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=277, Invalid=1363, Unknown=0, NotChecked=0, Total=1640 [2024-11-09 07:47:11,486 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 162 mSDsluCounter, 998 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:47:11,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 1085 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:47:11,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-11-09 07:47:11,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 287. [2024-11-09 07:47:11,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 239 states have (on average 1.4225941422594142) internal successors, (340), 270 states have internal predecessors, (340), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (16), 10 states have call predecessors, (16), 10 states have call successors, (16) [2024-11-09 07:47:11,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 366 transitions. [2024-11-09 07:47:11,498 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 366 transitions. Word has length 52 [2024-11-09 07:47:11,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:47:11,498 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 366 transitions. [2024-11-09 07:47:11,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 19 states have internal predecessors, (76), 4 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:47:11,499 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 366 transitions. [2024-11-09 07:47:11,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 07:47:11,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:47:11,499 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:47:11,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 07:47:11,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:47:11,704 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:47:11,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:47:11,704 INFO L85 PathProgramCache]: Analyzing trace with hash -514287632, now seen corresponding path program 1 times [2024-11-09 07:47:11,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:47:11,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129924550] [2024-11-09 07:47:11,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:47:11,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:47:11,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:47:12,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 07:47:12,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:47:12,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 07:47:12,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:47:12,356 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:47:12,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:47:12,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129924550] [2024-11-09 07:47:12,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129924550] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:47:12,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530016967] [2024-11-09 07:47:12,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:47:12,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:47:12,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:47:12,359 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:47:12,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 07:47:12,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:47:12,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-09 07:47:12,607 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:47:12,612 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-09 07:47:12,618 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 1 [2024-11-09 07:47:12,674 WARN L873 $PredicateComparison]: unable to prove that (exists ((append_~node~0.base Int)) (and (= (store |c_old(#length)| append_~node~0.base (select |c_#length| append_~node~0.base)) |c_#length|) (= (select |c_old(#valid)| append_~node~0.base) 0) (= |c_#valid| (store |c_old(#valid)| append_~node~0.base (select |c_#valid| append_~node~0.base))))) is different from true [2024-11-09 07:47:12,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:47:12,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:47:12,759 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 07:47:12,760 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 19 treesize of output 16 [2024-11-09 07:47:12,790 WARN L873 $PredicateComparison]: unable to prove that (exists ((append_~node~0.base Int)) (and (= (store |c_old(#length)| append_~node~0.base (select |c_#length| append_~node~0.base)) |c_#length|) (= (select |c_old(#valid)| append_~node~0.base) 0))) is different from true [2024-11-09 07:47:12,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:47:12,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:47:12,850 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:47:12,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:47:12,882 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:47:12,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-09 07:47:12,915 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 11 not checked. [2024-11-09 07:47:12,915 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:47:13,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530016967] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:47:13,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:47:13,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2024-11-09 07:47:13,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746322100] [2024-11-09 07:47:13,119 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:47:13,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 07:47:13,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:47:13,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 07:47:13,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=287, Unknown=2, NotChecked=70, Total=420 [2024-11-09 07:47:13,121 INFO L87 Difference]: Start difference. First operand 287 states and 366 transitions. Second operand has 17 states, 16 states have (on average 5.375) internal successors, (86), 14 states have internal predecessors, (86), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:47:14,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:47:14,208 INFO L93 Difference]: Finished difference Result 402 states and 502 transitions. [2024-11-09 07:47:14,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 07:47:14,211 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 5.375) internal successors, (86), 14 states have internal predecessors, (86), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 54 [2024-11-09 07:47:14,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:47:14,213 INFO L225 Difference]: With dead ends: 402 [2024-11-09 07:47:14,213 INFO L226 Difference]: Without dead ends: 402 [2024-11-09 07:47:14,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=157, Invalid=661, Unknown=2, NotChecked=110, Total=930 [2024-11-09 07:47:14,214 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 210 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 1328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 427 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:47:14,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 949 Invalid, 1328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 879 Invalid, 0 Unknown, 427 Unchecked, 0.6s Time] [2024-11-09 07:47:14,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2024-11-09 07:47:14,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 232. [2024-11-09 07:47:14,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 192 states have (on average 1.2760416666666667) internal successors, (245), 215 states have internal predecessors, (245), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (16), 10 states have call predecessors, (16), 10 states have call successors, (16) [2024-11-09 07:47:14,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 271 transitions. [2024-11-09 07:47:14,223 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 271 transitions. Word has length 54 [2024-11-09 07:47:14,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:47:14,224 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 271 transitions. [2024-11-09 07:47:14,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 5.375) internal successors, (86), 14 states have internal predecessors, (86), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:47:14,224 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 271 transitions. [2024-11-09 07:47:14,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 07:47:14,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:47:14,225 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:47:14,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-09 07:47:14,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-09 07:47:14,430 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:47:14,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:47:14,430 INFO L85 PathProgramCache]: Analyzing trace with hash 948068346, now seen corresponding path program 1 times [2024-11-09 07:47:14,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:47:14,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722939981] [2024-11-09 07:47:14,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:47:14,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:47:14,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:47:15,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 07:47:15,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:47:15,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 07:47:15,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:47:16,239 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:47:16,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:47:16,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722939981] [2024-11-09 07:47:16,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722939981] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:47:16,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215433068] [2024-11-09 07:47:16,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:47:16,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:47:16,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:47:16,241 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:47:16,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 07:47:16,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:47:16,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-09 07:47:16,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:47:16,481 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 1 [2024-11-09 07:47:16,485 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-09 07:47:16,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 07:47:16,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 07:47:16,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:47:16,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-09 07:47:16,672 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2024-11-09 07:47:16,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2024-11-09 07:47:16,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-09 07:47:16,734 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:47:16,734 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:47:17,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2024-11-09 07:47:17,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 70 [2024-11-09 07:47:17,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 94 [2024-11-09 07:47:17,395 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:47:17,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215433068] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:47:17,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:47:17,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 6, 6] total 28 [2024-11-09 07:47:17,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682125591] [2024-11-09 07:47:17,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:47:17,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-09 07:47:17,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:47:17,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-09 07:47:17,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=732, Unknown=0, NotChecked=0, Total=812 [2024-11-09 07:47:17,398 INFO L87 Difference]: Start difference. First operand 232 states and 271 transitions. Second operand has 29 states, 28 states have (on average 4.857142857142857) internal successors, (136), 27 states have internal predecessors, (136), 6 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 07:47:18,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:47:18,553 INFO L93 Difference]: Finished difference Result 282 states and 318 transitions. [2024-11-09 07:47:18,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-09 07:47:18,553 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 4.857142857142857) internal successors, (136), 27 states have internal predecessors, (136), 6 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 60 [2024-11-09 07:47:18,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:47:18,555 INFO L225 Difference]: With dead ends: 282 [2024-11-09 07:47:18,556 INFO L226 Difference]: Without dead ends: 282 [2024-11-09 07:47:18,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=253, Invalid=1727, Unknown=0, NotChecked=0, Total=1980 [2024-11-09 07:47:18,557 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 260 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 1121 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 1140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 07:47:18,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 901 Invalid, 1140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1121 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 07:47:18,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-09 07:47:18,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 205. [2024-11-09 07:47:18,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 169 states have (on average 1.2840236686390532) internal successors, (217), 193 states have internal predecessors, (217), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 07:47:18,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 231 transitions. [2024-11-09 07:47:18,566 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 231 transitions. Word has length 60 [2024-11-09 07:47:18,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:47:18,567 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 231 transitions. [2024-11-09 07:47:18,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 4.857142857142857) internal successors, (136), 27 states have internal predecessors, (136), 6 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 07:47:18,567 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 231 transitions. [2024-11-09 07:47:18,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 07:47:18,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:47:18,568 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:47:18,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-09 07:47:18,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-09 07:47:18,770 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:47:18,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:47:18,770 INFO L85 PathProgramCache]: Analyzing trace with hash 948068345, now seen corresponding path program 1 times [2024-11-09 07:47:18,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:47:18,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636785134] [2024-11-09 07:47:18,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:47:18,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:47:18,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:47:19,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 07:47:19,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:47:19,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 07:47:19,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:47:19,483 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:47:19,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:47:19,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636785134] [2024-11-09 07:47:19,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636785134] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:47:19,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764129176] [2024-11-09 07:47:19,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:47:19,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:47:19,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:47:19,486 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:47:19,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 07:47:19,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:47:19,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-09 07:47:19,774 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:47:19,787 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-09 07:47:19,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:47:19,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2024-11-09 07:47:19,918 INFO L349 Elim1Store]: treesize reduction 38, result has 36.7 percent of original size [2024-11-09 07:47:19,918 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 28 [2024-11-09 07:47:19,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:47:19,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 12 [2024-11-09 07:47:19,963 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:47:19,963 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:47:20,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 90 [2024-11-09 07:47:20,807 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:47:20,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764129176] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:47:20,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:47:20,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 7] total 24 [2024-11-09 07:47:20,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852194528] [2024-11-09 07:47:20,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:47:20,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-09 07:47:20,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:47:20,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-09 07:47:20,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2024-11-09 07:47:20,810 INFO L87 Difference]: Start difference. First operand 205 states and 231 transitions. Second operand has 25 states, 24 states have (on average 5.125) internal successors, (123), 23 states have internal predecessors, (123), 6 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 07:47:21,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:47:21,686 INFO L93 Difference]: Finished difference Result 304 states and 341 transitions. [2024-11-09 07:47:21,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-09 07:47:21,686 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 5.125) internal successors, (123), 23 states have internal predecessors, (123), 6 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 60 [2024-11-09 07:47:21,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:47:21,688 INFO L225 Difference]: With dead ends: 304 [2024-11-09 07:47:21,688 INFO L226 Difference]: Without dead ends: 304 [2024-11-09 07:47:21,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=227, Invalid=1255, Unknown=0, NotChecked=0, Total=1482 [2024-11-09 07:47:21,689 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 336 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 1043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:47:21,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 1008 Invalid, 1043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1020 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 07:47:21,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-11-09 07:47:21,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 205. [2024-11-09 07:47:21,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 169 states have (on average 1.2781065088757397) internal successors, (216), 193 states have internal predecessors, (216), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 07:47:21,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 230 transitions. [2024-11-09 07:47:21,695 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 230 transitions. Word has length 60 [2024-11-09 07:47:21,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:47:21,695 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 230 transitions. [2024-11-09 07:47:21,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 5.125) internal successors, (123), 23 states have internal predecessors, (123), 6 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 07:47:21,696 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 230 transitions. [2024-11-09 07:47:21,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 07:47:21,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:47:21,697 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:47:21,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-09 07:47:21,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-09 07:47:21,901 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:47:21,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:47:21,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1111373973, now seen corresponding path program 1 times [2024-11-09 07:47:21,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:47:21,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637766311] [2024-11-09 07:47:21,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:47:21,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:47:21,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:47:22,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 07:47:22,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:47:23,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 07:47:23,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:47:23,128 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 07:47:23,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:47:23,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637766311] [2024-11-09 07:47:23,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637766311] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:47:23,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440949688] [2024-11-09 07:47:23,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:47:23,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:47:23,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:47:23,132 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:47:23,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-09 07:47:23,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:47:23,418 INFO L255 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-09 07:47:23,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:47:23,424 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-09 07:47:23,446 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:47:23,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:47:23,465 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 13 treesize of output 9 [2024-11-09 07:47:23,470 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 13 treesize of output 9 [2024-11-09 07:47:27,631 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~list2~0#1.offset| 4))) (and (or (exists ((|v_#memory_$Pointer$#1.base_BEFORE_CALL_15| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_15| |c_#memory_$Pointer$#1.base|))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| .cse0) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_15| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse1) 0) (= |c_#memory_$Pointer$#1.base| (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_15| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0)))))) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse1) 0)) (or (exists ((|v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_29| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_29| |c_#memory_$Pointer$#1.offset|))) (and (= |c_#memory_$Pointer$#1.offset| (store |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_29| .cse2 (select |c_#memory_$Pointer$#1.offset| .cse2))) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse2) (= (select (select |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_29| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse1) 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse1) 0)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|)))) is different from false [2024-11-09 07:47:27,634 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~list2~0#1.offset| 4))) (and (or (exists ((|v_#memory_$Pointer$#1.base_BEFORE_CALL_15| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_15| |c_#memory_$Pointer$#1.base|))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| .cse0) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_15| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse1) 0) (= |c_#memory_$Pointer$#1.base| (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_15| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0)))))) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse1) 0)) (or (exists ((|v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_29| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_29| |c_#memory_$Pointer$#1.offset|))) (and (= |c_#memory_$Pointer$#1.offset| (store |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_29| .cse2 (select |c_#memory_$Pointer$#1.offset| .cse2))) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse2) (= (select (select |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_29| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse1) 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse1) 0)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|)))) is different from true [2024-11-09 07:47:31,776 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~list2~0#1.offset| 4))) (and (or (exists ((|v_#memory_$Pointer$#1.base_BEFORE_CALL_17| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_17| |c_#memory_$Pointer$#1.base|))) (and (not (= |c_ULTIMATE.start_main_~list2~0#1.base| .cse0)) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_17| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse1) 0) (= |c_#memory_$Pointer$#1.base| (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_17| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0)))))) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse1) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse1) 0))) is different from false [2024-11-09 07:47:31,778 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~list2~0#1.offset| 4))) (and (or (exists ((|v_#memory_$Pointer$#1.base_BEFORE_CALL_17| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_17| |c_#memory_$Pointer$#1.base|))) (and (not (= |c_ULTIMATE.start_main_~list2~0#1.base| .cse0)) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_17| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse1) 0) (= |c_#memory_$Pointer$#1.base| (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_17| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0)))))) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse1) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse1) 0))) is different from true [2024-11-09 07:47:31,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 07:47:31,893 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 1 not checked. [2024-11-09 07:47:31,893 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:47:31,977 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~list2~0#1.offset| 4))) (and (forall ((v_ArrVal_3552 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_3552) |c_ULTIMATE.start_main_~list2~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_3553 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_3553) |c_ULTIMATE.start_main_~list2~0#1.base|) .cse0) 0)))) is different from false [2024-11-09 07:47:31,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440949688] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:47:31,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:47:31,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 28 [2024-11-09 07:47:31,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802843193] [2024-11-09 07:47:31,979 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:47:31,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-09 07:47:31,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:47:31,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-09 07:47:31,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=667, Unknown=5, NotChecked=162, Total=930 [2024-11-09 07:47:31,980 INFO L87 Difference]: Start difference. First operand 205 states and 230 transitions. Second operand has 28 states, 28 states have (on average 2.857142857142857) internal successors, (80), 22 states have internal predecessors, (80), 5 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:47:36,102 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list2~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~list2~0#1.offset| 4))) (let ((.cse3 (= (select .cse0 .cse2) 0)) (.cse5 (= (select .cse7 .cse2) 0))) (and (= (select .cse0 4) 0) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (or (exists ((|v_#memory_$Pointer$#1.base_BEFORE_CALL_15| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_15| |c_#memory_$Pointer$#1.base|))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| .cse1) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_15| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse2) 0) (= |c_#memory_$Pointer$#1.base| (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_15| .cse1 (select |c_#memory_$Pointer$#1.base| .cse1)))))) .cse3) (or (exists ((|v_#memory_$Pointer$#1.base_BEFORE_CALL_17| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_17| |c_#memory_$Pointer$#1.base|))) (and (not (= |c_ULTIMATE.start_main_~list2~0#1.base| .cse4)) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_17| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse2) 0) (= |c_#memory_$Pointer$#1.base| (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_17| .cse4 (select |c_#memory_$Pointer$#1.base| .cse4)))))) .cse3) (= |c_ULTIMATE.start_main_~list2~0#1.offset| 0) .cse5 (or (exists ((|v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_29| (Array Int (Array Int Int)))) (let ((.cse6 (@diff |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_29| |c_#memory_$Pointer$#1.offset|))) (and (= |c_#memory_$Pointer$#1.offset| (store |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_29| .cse6 (select |c_#memory_$Pointer$#1.offset| .cse6))) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse6) (= (select (select |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_29| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse2) 0)))) .cse5) (= (select .cse7 4) 0) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|))))) is different from false [2024-11-09 07:47:36,106 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list2~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~list2~0#1.offset| 4))) (let ((.cse3 (= (select .cse0 .cse2) 0)) (.cse5 (= (select .cse7 .cse2) 0))) (and (= (select .cse0 4) 0) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (or (exists ((|v_#memory_$Pointer$#1.base_BEFORE_CALL_15| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_15| |c_#memory_$Pointer$#1.base|))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| .cse1) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_15| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse2) 0) (= |c_#memory_$Pointer$#1.base| (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_15| .cse1 (select |c_#memory_$Pointer$#1.base| .cse1)))))) .cse3) (or (exists ((|v_#memory_$Pointer$#1.base_BEFORE_CALL_17| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_17| |c_#memory_$Pointer$#1.base|))) (and (not (= |c_ULTIMATE.start_main_~list2~0#1.base| .cse4)) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_17| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse2) 0) (= |c_#memory_$Pointer$#1.base| (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_17| .cse4 (select |c_#memory_$Pointer$#1.base| .cse4)))))) .cse3) (= |c_ULTIMATE.start_main_~list2~0#1.offset| 0) .cse5 (or (exists ((|v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_29| (Array Int (Array Int Int)))) (let ((.cse6 (@diff |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_29| |c_#memory_$Pointer$#1.offset|))) (and (= |c_#memory_$Pointer$#1.offset| (store |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_29| .cse6 (select |c_#memory_$Pointer$#1.offset| .cse6))) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse6) (= (select (select |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_29| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse2) 0)))) .cse5) (= (select .cse7 4) 0) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|))))) is different from true [2024-11-09 07:47:36,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:47:36,480 INFO L93 Difference]: Finished difference Result 226 states and 245 transitions. [2024-11-09 07:47:36,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 07:47:36,481 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.857142857142857) internal successors, (80), 22 states have internal predecessors, (80), 5 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 65 [2024-11-09 07:47:36,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:47:36,482 INFO L225 Difference]: With dead ends: 226 [2024-11-09 07:47:36,482 INFO L226 Difference]: Without dead ends: 226 [2024-11-09 07:47:36,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=196, Invalid=1145, Unknown=7, NotChecked=292, Total=1640 [2024-11-09 07:47:36,483 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 324 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 323 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:47:36,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 630 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 567 Invalid, 0 Unknown, 323 Unchecked, 0.3s Time] [2024-11-09 07:47:36,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-09 07:47:36,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 175. [2024-11-09 07:47:36,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 143 states have (on average 1.3006993006993006) internal successors, (186), 165 states have internal predecessors, (186), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 07:47:36,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 198 transitions. [2024-11-09 07:47:36,491 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 198 transitions. Word has length 65 [2024-11-09 07:47:36,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:47:36,491 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 198 transitions. [2024-11-09 07:47:36,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.857142857142857) internal successors, (80), 22 states have internal predecessors, (80), 5 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:47:36,492 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 198 transitions. [2024-11-09 07:47:36,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-09 07:47:36,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:47:36,495 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:47:36,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-09 07:47:36,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-09 07:47:36,696 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:47:36,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:47:36,696 INFO L85 PathProgramCache]: Analyzing trace with hash -850577046, now seen corresponding path program 2 times [2024-11-09 07:47:36,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:47:36,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15232692] [2024-11-09 07:47:36,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:47:36,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:47:36,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:47:36,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 07:47:36,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:47:36,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 07:47:37,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:47:37,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 07:47:37,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:47:37,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 07:47:37,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:47:37,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 07:47:37,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:47:37,202 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 44 proven. 65 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-11-09 07:47:37,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:47:37,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15232692] [2024-11-09 07:47:37,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15232692] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:47:37,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775742924] [2024-11-09 07:47:37,203 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:47:37,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:47:37,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:47:37,205 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:47:37,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-09 07:47:37,740 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:47:37,740 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:47:37,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 854 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 07:47:37,745 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:47:37,806 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2024-11-09 07:47:37,806 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:47:37,890 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2024-11-09 07:47:37,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775742924] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:47:37,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:47:37,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 18 [2024-11-09 07:47:37,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816056288] [2024-11-09 07:47:37,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:47:37,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 07:47:37,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:47:37,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 07:47:37,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-09 07:47:37,893 INFO L87 Difference]: Start difference. First operand 175 states and 198 transitions. Second operand has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 17 states have internal predecessors, (76), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-09 07:47:38,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:47:38,303 INFO L93 Difference]: Finished difference Result 199 states and 206 transitions. [2024-11-09 07:47:38,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 07:47:38,303 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 17 states have internal predecessors, (76), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 102 [2024-11-09 07:47:38,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:47:38,304 INFO L225 Difference]: With dead ends: 199 [2024-11-09 07:47:38,304 INFO L226 Difference]: Without dead ends: 199 [2024-11-09 07:47:38,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 210 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=897, Unknown=0, NotChecked=0, Total=1056 [2024-11-09 07:47:38,304 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 235 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:47:38,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 757 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:47:38,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-09 07:47:38,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 179. [2024-11-09 07:47:38,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 146 states have (on average 1.3150684931506849) internal successors, (192), 168 states have internal predecessors, (192), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 07:47:38,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 206 transitions. [2024-11-09 07:47:38,308 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 206 transitions. Word has length 102 [2024-11-09 07:47:38,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:47:38,308 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 206 transitions. [2024-11-09 07:47:38,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 17 states have internal predecessors, (76), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-09 07:47:38,309 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 206 transitions. [2024-11-09 07:47:38,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-09 07:47:38,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:47:38,310 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:47:38,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-09 07:47:38,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:47:38,510 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:47:38,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:47:38,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1145027360, now seen corresponding path program 1 times [2024-11-09 07:47:38,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:47:38,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871824372] [2024-11-09 07:47:38,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:47:38,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:47:38,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:47:39,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 07:47:39,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:47:39,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 07:47:39,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:47:39,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 07:47:39,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:47:39,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 07:47:39,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:47:39,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 07:47:39,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:47:39,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 07:47:39,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:47:39,504 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2024-11-09 07:47:39,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:47:39,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871824372] [2024-11-09 07:47:39,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871824372] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:47:39,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069026529] [2024-11-09 07:47:39,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:47:39,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:47:39,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:47:39,507 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:47:39,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-09 07:47:39,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:47:39,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-09 07:47:39,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:47:39,930 WARN L873 $PredicateComparison]: unable to prove that (exists ((append_~node~0.base Int)) (and (= (select |c_old(#valid)| append_~node~0.base) 0) (= |c_#valid| (store |c_old(#valid)| append_~node~0.base (select |c_#valid| append_~node~0.base))))) is different from true [2024-11-09 07:47:39,986 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 07:47:39,987 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 19 treesize of output 16 [2024-11-09 07:47:40,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 07:47:40,089 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-11-09 07:47:40,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 19 [2024-11-09 07:47:40,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-09 07:47:40,267 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-09 07:47:40,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2024-11-09 07:47:40,283 WARN L873 $PredicateComparison]: unable to prove that (exists ((append_~node~0.base Int)) (= |c_#valid| (store |c_old(#valid)| append_~node~0.base 1))) is different from true [2024-11-09 07:47:40,304 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 07:47:40,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-09 07:47:40,338 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 07:47:40,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-09 07:47:40,348 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 22 proven. 33 refuted. 0 times theorem prover too weak. 49 trivial. 115 not checked. [2024-11-09 07:47:40,348 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:47:40,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2024-11-09 07:47:41,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069026529] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:47:41,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:47:41,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15] total 19 [2024-11-09 07:47:41,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067919051] [2024-11-09 07:47:41,244 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:47:41,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 07:47:41,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:47:41,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 07:47:41,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=536, Unknown=2, NotChecked=98, Total=756 [2024-11-09 07:47:41,246 INFO L87 Difference]: Start difference. First operand 179 states and 206 transitions. Second operand has 20 states, 19 states have (on average 6.526315789473684) internal successors, (124), 17 states have internal predecessors, (124), 3 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 07:47:41,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:47:41,786 INFO L93 Difference]: Finished difference Result 204 states and 231 transitions. [2024-11-09 07:47:41,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 07:47:41,787 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 6.526315789473684) internal successors, (124), 17 states have internal predecessors, (124), 3 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 128 [2024-11-09 07:47:41,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:47:41,788 INFO L225 Difference]: With dead ends: 204 [2024-11-09 07:47:41,788 INFO L226 Difference]: Without dead ends: 204 [2024-11-09 07:47:41,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 202 SyntacticMatches, 12 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=259, Invalid=1007, Unknown=2, NotChecked=138, Total=1406 [2024-11-09 07:47:41,789 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 105 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 228 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:47:41,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 518 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 443 Invalid, 0 Unknown, 228 Unchecked, 0.3s Time] [2024-11-09 07:47:41,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-09 07:47:41,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 178. [2024-11-09 07:47:41,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 146 states have (on average 1.3082191780821917) internal successors, (191), 167 states have internal predecessors, (191), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 07:47:41,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 205 transitions. [2024-11-09 07:47:41,793 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 205 transitions. Word has length 128 [2024-11-09 07:47:41,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:47:41,794 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 205 transitions. [2024-11-09 07:47:41,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 6.526315789473684) internal successors, (124), 17 states have internal predecessors, (124), 3 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 07:47:41,794 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 205 transitions. [2024-11-09 07:47:41,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-09 07:47:41,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:47:41,795 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:47:41,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-09 07:47:41,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-09 07:47:41,996 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:47:41,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:47:41,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1145027361, now seen corresponding path program 1 times [2024-11-09 07:47:41,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:47:41,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301642668] [2024-11-09 07:47:41,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:47:41,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:47:42,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:47:42,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 07:47:42,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:47:42,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 07:47:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:47:42,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 07:47:42,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:47:43,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 07:47:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:47:43,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 07:47:43,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:47:43,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 07:47:43,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:47:43,215 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-09 07:47:43,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:47:43,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301642668] [2024-11-09 07:47:43,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301642668] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:47:43,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13082272] [2024-11-09 07:47:43,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:47:43,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:47:43,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:47:43,218 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:47:43,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-09 07:47:43,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:47:43,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 97 conjuncts are in the unsatisfiable core [2024-11-09 07:47:43,631 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:47:43,760 WARN L873 $PredicateComparison]: unable to prove that (exists ((append_~node~0.base Int)) (and (= (store |c_old(#length)| append_~node~0.base (select |c_#length| append_~node~0.base)) |c_#length|) (= (select |c_old(#valid)| append_~node~0.base) 0) (= |c_#valid| (store |c_old(#valid)| append_~node~0.base (select |c_#valid| append_~node~0.base))))) is different from true [2024-11-09 07:47:43,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:47:43,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:47:43,823 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 07:47:43,823 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 19 treesize of output 16 [2024-11-09 07:47:43,842 WARN L873 $PredicateComparison]: unable to prove that (exists ((append_~node~0.base Int)) (and (= (store |c_old(#length)| append_~node~0.base (select |c_#length| append_~node~0.base)) |c_#length|) (= (select |c_old(#valid)| append_~node~0.base) 0))) is different from true [2024-11-09 07:47:43,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:47:43,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:47:43,889 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:47:43,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:47:44,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 07:47:44,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 07:47:44,040 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-11-09 07:47:44,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 19 [2024-11-09 07:47:44,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 23 [2024-11-09 07:47:44,401 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-11-09 07:47:44,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 23 [2024-11-09 07:47:44,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 11 [2024-11-09 07:47:44,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2024-11-09 07:47:44,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 07:47:44,777 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2024-11-09 07:47:44,777 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 3 case distinctions, treesize of input 23 treesize of output 37 [2024-11-09 07:47:44,862 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 35 proven. 87 refuted. 0 times theorem prover too weak. 4 trivial. 93 not checked. [2024-11-09 07:47:44,862 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:47:45,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13082272] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:47:45,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:47:45,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 25] total 36 [2024-11-09 07:47:45,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089058398] [2024-11-09 07:47:45,038 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:47:45,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-09 07:47:45,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:47:45,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-09 07:47:45,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1201, Unknown=2, NotChecked=142, Total=1482 [2024-11-09 07:47:45,040 INFO L87 Difference]: Start difference. First operand 178 states and 205 transitions. Second operand has 37 states, 36 states have (on average 5.083333333333333) internal successors, (183), 33 states have internal predecessors, (183), 5 states have call successors, (8), 5 states have call predecessors, (8), 10 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-09 07:47:49,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:47:53,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:47:57,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:47:58,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:47:58,762 INFO L93 Difference]: Finished difference Result 215 states and 246 transitions. [2024-11-09 07:47:58,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 07:47:58,762 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 5.083333333333333) internal successors, (183), 33 states have internal predecessors, (183), 5 states have call successors, (8), 5 states have call predecessors, (8), 10 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 128 [2024-11-09 07:47:58,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:47:58,763 INFO L225 Difference]: With dead ends: 215 [2024-11-09 07:47:58,764 INFO L226 Difference]: Without dead ends: 215 [2024-11-09 07:47:58,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 123 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=385, Invalid=2483, Unknown=2, NotChecked=210, Total=3080 [2024-11-09 07:47:58,765 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 357 mSDsluCounter, 1206 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 18 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 1275 SdHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 271 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2024-11-09 07:47:58,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 1275 Invalid, 1474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1182 Invalid, 3 Unknown, 271 Unchecked, 12.8s Time] [2024-11-09 07:47:58,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-09 07:47:58,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 177. [2024-11-09 07:47:58,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 146 states have (on average 1.3013698630136987) internal successors, (190), 166 states have internal predecessors, (190), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 07:47:58,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 204 transitions. [2024-11-09 07:47:58,770 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 204 transitions. Word has length 128 [2024-11-09 07:47:58,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:47:58,770 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 204 transitions. [2024-11-09 07:47:58,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 5.083333333333333) internal successors, (183), 33 states have internal predecessors, (183), 5 states have call successors, (8), 5 states have call predecessors, (8), 10 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-09 07:47:58,770 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 204 transitions. [2024-11-09 07:47:58,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-09 07:47:58,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:47:58,772 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:47:58,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0