./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0217.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8be7027f 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/test-0217.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 163bc3b45d6f21a8e478003f84571178259b289b3d9717ecadbc4595fc507bec --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 13:21:15,011 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 13:21:15,070 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-12 13:21:15,075 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 13:21:15,078 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 13:21:15,104 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 13:21:15,105 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 13:21:15,106 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 13:21:15,106 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 13:21:15,107 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 13:21:15,107 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 13:21:15,108 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 13:21:15,108 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 13:21:15,108 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 13:21:15,110 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 13:21:15,110 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 13:21:15,110 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 13:21:15,111 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 13:21:15,111 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 13:21:15,111 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 13:21:15,111 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 13:21:15,114 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 13:21:15,115 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 13:21:15,115 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 13:21:15,115 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 13:21:15,115 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 13:21:15,116 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 13:21:15,116 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 13:21:15,116 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 13:21:15,116 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 13:21:15,116 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 13:21:15,117 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 13:21:15,117 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 13:21:15,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:21:15,117 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 13:21:15,117 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 13:21:15,117 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 13:21:15,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 13:21:15,118 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 13:21:15,118 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 13:21:15,118 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 13:21:15,119 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 13:21:15,119 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 -> 163bc3b45d6f21a8e478003f84571178259b289b3d9717ecadbc4595fc507bec [2024-11-12 13:21:15,334 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 13:21:15,354 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 13:21:15,357 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 13:21:15,358 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 13:21:15,360 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 13:21:15,361 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0217.i [2024-11-12 13:21:16,672 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 13:21:16,844 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 13:21:16,845 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0217.i [2024-11-12 13:21:16,858 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a5b18be7/dc8804a0d8914586a7052f2d9c9c86ff/FLAGaae83a1f1 [2024-11-12 13:21:16,870 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a5b18be7/dc8804a0d8914586a7052f2d9c9c86ff [2024-11-12 13:21:16,872 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 13:21:16,873 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 13:21:16,874 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 13:21:16,875 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 13:21:16,886 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 13:21:16,887 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:21:16" (1/1) ... [2024-11-12 13:21:16,888 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@387a1a3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:21:16, skipping insertion in model container [2024-11-12 13:21:16,888 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:21:16" (1/1) ... [2024-11-12 13:21:16,925 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 13:21:17,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:21:17,272 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 13:21:17,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:21:17,348 INFO L204 MainTranslator]: Completed translation [2024-11-12 13:21:17,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:21:17 WrapperNode [2024-11-12 13:21:17,349 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 13:21:17,350 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 13:21:17,350 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 13:21:17,350 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 13:21:17,358 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:21:17" (1/1) ... [2024-11-12 13:21:17,372 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:21:17" (1/1) ... [2024-11-12 13:21:17,396 INFO L138 Inliner]: procedures = 181, calls = 47, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 213 [2024-11-12 13:21:17,396 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 13:21:17,397 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 13:21:17,397 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 13:21:17,397 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 13:21:17,405 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:21:17" (1/1) ... [2024-11-12 13:21:17,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:21:17" (1/1) ... [2024-11-12 13:21:17,411 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:21:17" (1/1) ... [2024-11-12 13:21:17,430 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 11 writes are split as follows [0, 11]. [2024-11-12 13:21:17,431 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:21:17" (1/1) ... [2024-11-12 13:21:17,431 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:21:17" (1/1) ... [2024-11-12 13:21:17,445 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:21:17" (1/1) ... [2024-11-12 13:21:17,452 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:21:17" (1/1) ... [2024-11-12 13:21:17,453 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:21:17" (1/1) ... [2024-11-12 13:21:17,458 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:21:17" (1/1) ... [2024-11-12 13:21:17,461 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 13:21:17,462 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 13:21:17,462 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 13:21:17,462 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 13:21:17,467 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:21:17" (1/1) ... [2024-11-12 13:21:17,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:21:17,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:21:17,507 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-12 13:21:17,515 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-12 13:21:17,550 INFO L130 BoogieDeclarations]: Found specification of procedure rand_end_point [2024-11-12 13:21:17,550 INFO L138 BoogieDeclarations]: Found implementation of procedure rand_end_point [2024-11-12 13:21:17,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 13:21:17,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 13:21:17,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 13:21:17,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 13:21:17,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 13:21:17,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 13:21:17,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 13:21:17,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 13:21:17,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 13:21:17,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-12 13:21:17,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-12 13:21:17,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 13:21:17,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 13:21:17,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 13:21:17,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 13:21:17,677 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 13:21:17,679 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 13:21:18,019 INFO L? ?]: Removed 187 outVars from TransFormulas that were not future-live. [2024-11-12 13:21:18,019 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 13:21:18,039 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 13:21:18,041 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-12 13:21:18,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:21:18 BoogieIcfgContainer [2024-11-12 13:21:18,042 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 13:21:18,043 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 13:21:18,044 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 13:21:18,047 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 13:21:18,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:21:16" (1/3) ... [2024-11-12 13:21:18,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37d2c51b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:21:18, skipping insertion in model container [2024-11-12 13:21:18,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:21:17" (2/3) ... [2024-11-12 13:21:18,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37d2c51b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:21:18, skipping insertion in model container [2024-11-12 13:21:18,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:21:18" (3/3) ... [2024-11-12 13:21:18,051 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0217.i [2024-11-12 13:21:18,065 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 13:21:18,065 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 67 error locations. [2024-11-12 13:21:18,111 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 13:21:18,116 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;@4676ceb7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 13:21:18,117 INFO L334 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2024-11-12 13:21:18,121 INFO L276 IsEmpty]: Start isEmpty. Operand has 167 states, 96 states have (on average 1.9583333333333333) internal successors, (188), 163 states have internal predecessors, (188), 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-12 13:21:18,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-12 13:21:18,126 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:18,127 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 13:21:18,127 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:18,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:18,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1074518762, now seen corresponding path program 1 times [2024-11-12 13:21:18,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:18,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318344135] [2024-11-12 13:21:18,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:18,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:18,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:18,248 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-12 13:21:18,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:18,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318344135] [2024-11-12 13:21:18,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318344135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:18,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:18,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:21:18,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926173946] [2024-11-12 13:21:18,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:18,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 13:21:18,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:18,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 13:21:18,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 13:21:18,286 INFO L87 Difference]: Start difference. First operand has 167 states, 96 states have (on average 1.9583333333333333) internal successors, (188), 163 states have internal predecessors, (188), 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 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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-12 13:21:18,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:18,305 INFO L93 Difference]: Finished difference Result 167 states and 186 transitions. [2024-11-12 13:21:18,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 13:21:18,307 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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-12 13:21:18,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:18,313 INFO L225 Difference]: With dead ends: 167 [2024-11-12 13:21:18,313 INFO L226 Difference]: Without dead ends: 165 [2024-11-12 13:21:18,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 13:21:18,317 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:18,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:21:18,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-12 13:21:18,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2024-11-12 13:21:18,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 95 states have (on average 1.894736842105263) internal successors, (180), 161 states have internal predecessors, (180), 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-12 13:21:18,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 184 transitions. [2024-11-12 13:21:18,352 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 184 transitions. Word has length 6 [2024-11-12 13:21:18,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:18,353 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 184 transitions. [2024-11-12 13:21:18,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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-12 13:21:18,353 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 184 transitions. [2024-11-12 13:21:18,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-12 13:21:18,354 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:18,354 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:18,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 13:21:18,354 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:18,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:18,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1280331232, now seen corresponding path program 1 times [2024-11-12 13:21:18,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:18,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902649939] [2024-11-12 13:21:18,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:18,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:18,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:18,439 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-12 13:21:18,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:18,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902649939] [2024-11-12 13:21:18,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902649939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:18,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:18,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-12 13:21:18,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050345163] [2024-11-12 13:21:18,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:18,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:21:18,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:18,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:21:18,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:21:18,441 INFO L87 Difference]: Start difference. First operand 165 states and 184 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-12 13:21:18,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:18,634 INFO L93 Difference]: Finished difference Result 321 states and 358 transitions. [2024-11-12 13:21:18,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:21:18,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2024-11-12 13:21:18,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:18,637 INFO L225 Difference]: With dead ends: 321 [2024-11-12 13:21:18,637 INFO L226 Difference]: Without dead ends: 321 [2024-11-12 13:21:18,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-12 13:21:18,639 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 165 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:18,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 235 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:21:18,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-11-12 13:21:18,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 229. [2024-11-12 13:21:18,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 156 states have (on average 1.8717948717948718) internal successors, (292), 222 states have internal predecessors, (292), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:21:18,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 300 transitions. [2024-11-12 13:21:18,653 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 300 transitions. Word has length 7 [2024-11-12 13:21:18,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:18,653 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 300 transitions. [2024-11-12 13:21:18,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-12 13:21:18,653 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 300 transitions. [2024-11-12 13:21:18,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-12 13:21:18,654 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:18,654 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:18,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 13:21:18,654 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:18,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:18,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1280331231, now seen corresponding path program 1 times [2024-11-12 13:21:18,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:18,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666894828] [2024-11-12 13:21:18,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:18,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:18,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:18,781 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-12 13:21:18,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:18,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666894828] [2024-11-12 13:21:18,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666894828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:18,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:18,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:21:18,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877662847] [2024-11-12 13:21:18,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:18,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:21:18,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:18,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:21:18,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:21:18,785 INFO L87 Difference]: Start difference. First operand 229 states and 300 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-12 13:21:18,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:18,904 INFO L93 Difference]: Finished difference Result 353 states and 447 transitions. [2024-11-12 13:21:18,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:21:18,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2024-11-12 13:21:18,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:18,906 INFO L225 Difference]: With dead ends: 353 [2024-11-12 13:21:18,906 INFO L226 Difference]: Without dead ends: 353 [2024-11-12 13:21:18,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:21:18,907 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 103 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:18,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 353 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:18,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-11-12 13:21:18,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 302. [2024-11-12 13:21:18,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 223 states have (on average 1.8340807174887892) internal successors, (409), 291 states have internal predecessors, (409), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 13:21:18,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 425 transitions. [2024-11-12 13:21:18,932 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 425 transitions. Word has length 7 [2024-11-12 13:21:18,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:18,932 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 425 transitions. [2024-11-12 13:21:18,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-12 13:21:18,932 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 425 transitions. [2024-11-12 13:21:18,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-12 13:21:18,933 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:18,933 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:18,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 13:21:18,933 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:18,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:18,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1280331169, now seen corresponding path program 1 times [2024-11-12 13:21:18,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:18,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482060217] [2024-11-12 13:21:18,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:18,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:18,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:19,036 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-12 13:21:19,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:19,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482060217] [2024-11-12 13:21:19,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482060217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:19,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:19,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:21:19,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26526813] [2024-11-12 13:21:19,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:19,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:21:19,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:19,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:21:19,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:21:19,039 INFO L87 Difference]: Start difference. First operand 302 states and 425 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-12 13:21:19,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:19,146 INFO L93 Difference]: Finished difference Result 352 states and 445 transitions. [2024-11-12 13:21:19,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:21:19,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2024-11-12 13:21:19,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:19,148 INFO L225 Difference]: With dead ends: 352 [2024-11-12 13:21:19,148 INFO L226 Difference]: Without dead ends: 352 [2024-11-12 13:21:19,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:21:19,150 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 100 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:19,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 354 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:19,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-11-12 13:21:19,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 302. [2024-11-12 13:21:19,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 223 states have (on average 1.8340807174887892) internal successors, (409), 291 states have internal predecessors, (409), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 13:21:19,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 425 transitions. [2024-11-12 13:21:19,170 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 425 transitions. Word has length 7 [2024-11-12 13:21:19,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:19,170 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 425 transitions. [2024-11-12 13:21:19,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-12 13:21:19,171 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 425 transitions. [2024-11-12 13:21:19,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-12 13:21:19,171 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:19,171 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:19,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 13:21:19,172 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:19,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:19,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1257058894, now seen corresponding path program 1 times [2024-11-12 13:21:19,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:19,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070102418] [2024-11-12 13:21:19,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:19,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:19,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:19,377 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-12 13:21:19,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:19,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070102418] [2024-11-12 13:21:19,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070102418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:19,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:19,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 13:21:19,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430852382] [2024-11-12 13:21:19,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:19,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 13:21:19,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:19,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 13:21:19,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:21:19,382 INFO L87 Difference]: Start difference. First operand 302 states and 425 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-12 13:21:19,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:19,557 INFO L93 Difference]: Finished difference Result 446 states and 601 transitions. [2024-11-12 13:21:19,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:21:19,557 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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 10 [2024-11-12 13:21:19,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:19,560 INFO L225 Difference]: With dead ends: 446 [2024-11-12 13:21:19,560 INFO L226 Difference]: Without dead ends: 446 [2024-11-12 13:21:19,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:21:19,561 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 131 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:19,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 727 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:19,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-11-12 13:21:19,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 344. [2024-11-12 13:21:19,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 262 states have (on average 1.816793893129771) internal successors, (476), 331 states have internal predecessors, (476), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 13:21:19,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 496 transitions. [2024-11-12 13:21:19,570 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 496 transitions. Word has length 10 [2024-11-12 13:21:19,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:19,571 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 496 transitions. [2024-11-12 13:21:19,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-12 13:21:19,571 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 496 transitions. [2024-11-12 13:21:19,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-12 13:21:19,571 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:19,572 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:19,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 13:21:19,572 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:19,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:19,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1258905936, now seen corresponding path program 1 times [2024-11-12 13:21:19,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:19,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145015903] [2024-11-12 13:21:19,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:19,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:19,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:19,653 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-12 13:21:19,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:19,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145015903] [2024-11-12 13:21:19,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145015903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:19,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:19,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 13:21:19,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518733636] [2024-11-12 13:21:19,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:19,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 13:21:19,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:19,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 13:21:19,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:21:19,655 INFO L87 Difference]: Start difference. First operand 344 states and 496 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-12 13:21:19,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:19,810 INFO L93 Difference]: Finished difference Result 436 states and 590 transitions. [2024-11-12 13:21:19,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:21:19,811 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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 10 [2024-11-12 13:21:19,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:19,815 INFO L225 Difference]: With dead ends: 436 [2024-11-12 13:21:19,815 INFO L226 Difference]: Without dead ends: 436 [2024-11-12 13:21:19,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:21:19,816 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 116 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:19,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 772 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:19,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2024-11-12 13:21:19,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 343. [2024-11-12 13:21:19,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 261 states have (on average 1.8199233716475096) internal successors, (475), 330 states have internal predecessors, (475), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 13:21:19,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 495 transitions. [2024-11-12 13:21:19,826 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 495 transitions. Word has length 10 [2024-11-12 13:21:19,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:19,826 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 495 transitions. [2024-11-12 13:21:19,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-12 13:21:19,827 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 495 transitions. [2024-11-12 13:21:19,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-12 13:21:19,827 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:19,828 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:19,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 13:21:19,828 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:19,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:19,829 INFO L85 PathProgramCache]: Analyzing trace with hash 314118792, now seen corresponding path program 1 times [2024-11-12 13:21:19,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:19,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627451899] [2024-11-12 13:21:19,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:19,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:19,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:19,853 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-12 13:21:19,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:19,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627451899] [2024-11-12 13:21:19,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627451899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:19,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:19,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:21:19,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802826108] [2024-11-12 13:21:19,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:19,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:21:19,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:19,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:21:19,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:21:19,858 INFO L87 Difference]: Start difference. First operand 343 states and 495 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-12 13:21:19,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:19,959 INFO L93 Difference]: Finished difference Result 394 states and 542 transitions. [2024-11-12 13:21:19,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:21:19,960 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), 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 11 [2024-11-12 13:21:19,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:19,961 INFO L225 Difference]: With dead ends: 394 [2024-11-12 13:21:19,961 INFO L226 Difference]: Without dead ends: 387 [2024-11-12 13:21:19,961 INFO L434 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-12 13:21:19,962 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 64 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:19,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 273 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:19,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2024-11-12 13:21:19,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 340. [2024-11-12 13:21:19,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 258 states have (on average 1.821705426356589) internal successors, (470), 327 states have internal predecessors, (470), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 13:21:19,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 490 transitions. [2024-11-12 13:21:19,969 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 490 transitions. Word has length 11 [2024-11-12 13:21:19,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:19,970 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 490 transitions. [2024-11-12 13:21:19,970 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), 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-12 13:21:19,970 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 490 transitions. [2024-11-12 13:21:19,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-12 13:21:19,970 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:19,970 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:19,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 13:21:19,971 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:19,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:19,971 INFO L85 PathProgramCache]: Analyzing trace with hash -584855357, now seen corresponding path program 1 times [2024-11-12 13:21:19,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:19,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363106026] [2024-11-12 13:21:19,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:19,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:19,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:20,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 13:21:20,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:20,017 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-12 13:21:20,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:20,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363106026] [2024-11-12 13:21:20,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363106026] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:20,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:20,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:21:20,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596388061] [2024-11-12 13:21:20,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:20,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:21:20,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:20,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:21:20,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:21:20,020 INFO L87 Difference]: Start difference. First operand 340 states and 490 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-12 13:21:20,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:20,198 INFO L93 Difference]: Finished difference Result 448 states and 585 transitions. [2024-11-12 13:21:20,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:21:20,198 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 15 [2024-11-12 13:21:20,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:20,200 INFO L225 Difference]: With dead ends: 448 [2024-11-12 13:21:20,200 INFO L226 Difference]: Without dead ends: 448 [2024-11-12 13:21:20,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:21:20,201 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 169 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:20,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 340 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:21:20,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2024-11-12 13:21:20,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 346. [2024-11-12 13:21:20,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 264 states have (on average 1.803030303030303) internal successors, (476), 333 states have internal predecessors, (476), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 13:21:20,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 496 transitions. [2024-11-12 13:21:20,210 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 496 transitions. Word has length 15 [2024-11-12 13:21:20,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:20,210 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 496 transitions. [2024-11-12 13:21:20,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-12 13:21:20,210 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 496 transitions. [2024-11-12 13:21:20,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-12 13:21:20,211 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:20,211 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:20,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 13:21:20,211 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:20,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:20,212 INFO L85 PathProgramCache]: Analyzing trace with hash -584855356, now seen corresponding path program 1 times [2024-11-12 13:21:20,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:20,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774687478] [2024-11-12 13:21:20,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:20,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:20,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 13:21:20,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:20,276 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-12 13:21:20,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:20,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774687478] [2024-11-12 13:21:20,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774687478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:20,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:20,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:21:20,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465679070] [2024-11-12 13:21:20,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:20,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:21:20,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:20,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:21:20,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:21:20,278 INFO L87 Difference]: Start difference. First operand 346 states and 496 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-12 13:21:20,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:20,401 INFO L93 Difference]: Finished difference Result 394 states and 508 transitions. [2024-11-12 13:21:20,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:21:20,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 15 [2024-11-12 13:21:20,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:20,402 INFO L225 Difference]: With dead ends: 394 [2024-11-12 13:21:20,402 INFO L226 Difference]: Without dead ends: 394 [2024-11-12 13:21:20,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:21:20,403 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 102 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:20,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 432 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:20,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-12 13:21:20,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 346. [2024-11-12 13:21:20,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 264 states have (on average 1.768939393939394) internal successors, (467), 333 states have internal predecessors, (467), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 13:21:20,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 487 transitions. [2024-11-12 13:21:20,409 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 487 transitions. Word has length 15 [2024-11-12 13:21:20,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:20,409 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 487 transitions. [2024-11-12 13:21:20,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-12 13:21:20,410 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 487 transitions. [2024-11-12 13:21:20,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-12 13:21:20,410 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:20,410 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:20,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 13:21:20,411 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:20,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:20,411 INFO L85 PathProgramCache]: Analyzing trace with hash 590215118, now seen corresponding path program 1 times [2024-11-12 13:21:20,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:20,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307359579] [2024-11-12 13:21:20,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:20,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:20,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:20,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:20,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:20,491 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-12 13:21:20,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:20,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307359579] [2024-11-12 13:21:20,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307359579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:20,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:20,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:21:20,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652611203] [2024-11-12 13:21:20,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:20,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:21:20,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:20,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:21:20,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:21:20,493 INFO L87 Difference]: Start difference. First operand 346 states and 487 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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-12 13:21:20,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:20,722 INFO L93 Difference]: Finished difference Result 464 states and 606 transitions. [2024-11-12 13:21:20,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:21:20,723 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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 17 [2024-11-12 13:21:20,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:20,725 INFO L225 Difference]: With dead ends: 464 [2024-11-12 13:21:20,725 INFO L226 Difference]: Without dead ends: 464 [2024-11-12 13:21:20,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:21:20,726 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 338 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:20,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 324 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:21:20,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2024-11-12 13:21:20,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 343. [2024-11-12 13:21:20,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 265 states have (on average 1.739622641509434) internal successors, (461), 330 states have internal predecessors, (461), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 13:21:20,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 481 transitions. [2024-11-12 13:21:20,733 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 481 transitions. Word has length 17 [2024-11-12 13:21:20,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:20,734 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 481 transitions. [2024-11-12 13:21:20,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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-12 13:21:20,734 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 481 transitions. [2024-11-12 13:21:20,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-12 13:21:20,734 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:20,735 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:20,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 13:21:20,735 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:20,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:20,735 INFO L85 PathProgramCache]: Analyzing trace with hash 590215119, now seen corresponding path program 1 times [2024-11-12 13:21:20,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:20,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577423584] [2024-11-12 13:21:20,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:20,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:20,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:20,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:20,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:20,861 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-12 13:21:20,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:20,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577423584] [2024-11-12 13:21:20,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577423584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:20,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:20,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 13:21:20,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141913706] [2024-11-12 13:21:20,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:20,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 13:21:20,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:20,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 13:21:20,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:21:20,863 INFO L87 Difference]: Start difference. First operand 343 states and 481 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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-12 13:21:21,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:21,195 INFO L93 Difference]: Finished difference Result 492 states and 633 transitions. [2024-11-12 13:21:21,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 13:21:21,195 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 17 [2024-11-12 13:21:21,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:21,197 INFO L225 Difference]: With dead ends: 492 [2024-11-12 13:21:21,197 INFO L226 Difference]: Without dead ends: 492 [2024-11-12 13:21:21,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-12 13:21:21,198 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 280 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:21,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 450 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 13:21:21,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2024-11-12 13:21:21,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 376. [2024-11-12 13:21:21,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 296 states have (on average 1.7263513513513513) internal successors, (511), 362 states have internal predecessors, (511), 10 states have call successors, (10), 5 states have call predecessors, (10), 7 states have return successors, (14), 8 states have call predecessors, (14), 10 states have call successors, (14) [2024-11-12 13:21:21,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 535 transitions. [2024-11-12 13:21:21,205 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 535 transitions. Word has length 17 [2024-11-12 13:21:21,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:21,205 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 535 transitions. [2024-11-12 13:21:21,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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-12 13:21:21,206 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 535 transitions. [2024-11-12 13:21:21,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-12 13:21:21,206 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:21,206 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:21,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 13:21:21,207 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:21,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:21,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1217239344, now seen corresponding path program 1 times [2024-11-12 13:21:21,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:21,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749533090] [2024-11-12 13:21:21,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:21,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:21,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:21,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:21,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:21,263 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-12 13:21:21,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:21,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749533090] [2024-11-12 13:21:21,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749533090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:21,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:21,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 13:21:21,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688414575] [2024-11-12 13:21:21,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:21,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 13:21:21,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:21,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 13:21:21,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:21:21,265 INFO L87 Difference]: Start difference. First operand 376 states and 535 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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-12 13:21:21,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:21,286 INFO L93 Difference]: Finished difference Result 386 states and 547 transitions. [2024-11-12 13:21:21,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:21:21,286 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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 17 [2024-11-12 13:21:21,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:21,288 INFO L225 Difference]: With dead ends: 386 [2024-11-12 13:21:21,288 INFO L226 Difference]: Without dead ends: 386 [2024-11-12 13:21:21,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:21:21,289 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 1 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:21,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 901 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:21:21,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2024-11-12 13:21:21,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2024-11-12 13:21:21,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 303 states have (on average 1.7062706270627064) internal successors, (517), 371 states have internal predecessors, (517), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) [2024-11-12 13:21:21,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 547 transitions. [2024-11-12 13:21:21,295 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 547 transitions. Word has length 17 [2024-11-12 13:21:21,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:21,295 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 547 transitions. [2024-11-12 13:21:21,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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-12 13:21:21,295 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 547 transitions. [2024-11-12 13:21:21,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-12 13:21:21,296 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:21,296 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:21,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 13:21:21,296 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:21,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:21,297 INFO L85 PathProgramCache]: Analyzing trace with hash 920341577, now seen corresponding path program 1 times [2024-11-12 13:21:21,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:21,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004298174] [2024-11-12 13:21:21,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:21,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:21,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:21,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:21,476 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-12 13:21:21,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:21,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004298174] [2024-11-12 13:21:21,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004298174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:21,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:21,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 13:21:21,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168020382] [2024-11-12 13:21:21,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:21,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 13:21:21,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:21,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 13:21:21,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-12 13:21:21,478 INFO L87 Difference]: Start difference. First operand 386 states and 547 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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-12 13:21:21,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:21,908 INFO L93 Difference]: Finished difference Result 518 states and 674 transitions. [2024-11-12 13:21:21,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:21:21,909 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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 18 [2024-11-12 13:21:21,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:21,911 INFO L225 Difference]: With dead ends: 518 [2024-11-12 13:21:21,911 INFO L226 Difference]: Without dead ends: 518 [2024-11-12 13:21:21,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-12 13:21:21,911 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 280 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:21,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 706 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 13:21:21,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2024-11-12 13:21:21,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 383. [2024-11-12 13:21:21,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 300 states have (on average 1.7066666666666668) internal successors, (512), 368 states have internal predecessors, (512), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) [2024-11-12 13:21:21,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 542 transitions. [2024-11-12 13:21:21,918 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 542 transitions. Word has length 18 [2024-11-12 13:21:21,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:21,918 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 542 transitions. [2024-11-12 13:21:21,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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-12 13:21:21,919 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 542 transitions. [2024-11-12 13:21:21,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-12 13:21:21,919 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:21,919 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:21,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 13:21:21,919 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:21,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:21,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1931813849, now seen corresponding path program 1 times [2024-11-12 13:21:21,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:21,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816995566] [2024-11-12 13:21:21,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:21,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:21,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:22,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 13:21:22,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:22,069 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-12 13:21:22,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:22,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816995566] [2024-11-12 13:21:22,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816995566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:22,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:22,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 13:21:22,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653405050] [2024-11-12 13:21:22,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:22,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:21:22,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:22,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:21:22,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:21:22,071 INFO L87 Difference]: Start difference. First operand 383 states and 542 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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-12 13:21:22,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:22,347 INFO L93 Difference]: Finished difference Result 478 states and 643 transitions. [2024-11-12 13:21:22,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 13:21:22,348 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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 21 [2024-11-12 13:21:22,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:22,349 INFO L225 Difference]: With dead ends: 478 [2024-11-12 13:21:22,349 INFO L226 Difference]: Without dead ends: 478 [2024-11-12 13:21:22,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-11-12 13:21:22,350 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 109 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:22,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 1050 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:21:22,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2024-11-12 13:21:22,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 377. [2024-11-12 13:21:22,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 294 states have (on average 1.7040816326530612) internal successors, (501), 362 states have internal predecessors, (501), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) [2024-11-12 13:21:22,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 531 transitions. [2024-11-12 13:21:22,377 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 531 transitions. Word has length 21 [2024-11-12 13:21:22,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:22,377 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 531 transitions. [2024-11-12 13:21:22,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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-12 13:21:22,377 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 531 transitions. [2024-11-12 13:21:22,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-12 13:21:22,378 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:22,378 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:22,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 13:21:22,378 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:22,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:22,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1757289300, now seen corresponding path program 1 times [2024-11-12 13:21:22,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:22,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722931175] [2024-11-12 13:21:22,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:22,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:22,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:22,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:22,537 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-12 13:21:22,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:22,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722931175] [2024-11-12 13:21:22,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722931175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:22,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:22,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 13:21:22,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672808313] [2024-11-12 13:21:22,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:22,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:21:22,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:22,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:21:22,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:21:22,539 INFO L87 Difference]: Start difference. First operand 377 states and 531 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 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-12 13:21:22,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:22,759 INFO L93 Difference]: Finished difference Result 504 states and 681 transitions. [2024-11-12 13:21:22,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 13:21:22,760 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 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 21 [2024-11-12 13:21:22,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:22,761 INFO L225 Difference]: With dead ends: 504 [2024-11-12 13:21:22,761 INFO L226 Difference]: Without dead ends: 504 [2024-11-12 13:21:22,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-12 13:21:22,762 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 140 mSDsluCounter, 914 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:22,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1080 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:21:22,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2024-11-12 13:21:22,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 395. [2024-11-12 13:21:22,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 312 states have (on average 1.6826923076923077) internal successors, (525), 378 states have internal predecessors, (525), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2024-11-12 13:21:22,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 555 transitions. [2024-11-12 13:21:22,768 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 555 transitions. Word has length 21 [2024-11-12 13:21:22,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:22,769 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 555 transitions. [2024-11-12 13:21:22,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 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-12 13:21:22,769 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 555 transitions. [2024-11-12 13:21:22,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-12 13:21:22,770 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:22,770 INFO L218 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-12 13:21:22,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 13:21:22,770 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:22,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:22,770 INFO L85 PathProgramCache]: Analyzing trace with hash -2074565938, now seen corresponding path program 1 times [2024-11-12 13:21:22,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:22,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837652462] [2024-11-12 13:21:22,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:22,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:22,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:22,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:22,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:22,888 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-12 13:21:22,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:22,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837652462] [2024-11-12 13:21:22,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837652462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:22,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:22,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 13:21:22,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368292607] [2024-11-12 13:21:22,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:22,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:21:22,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:22,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:21:22,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:21:22,890 INFO L87 Difference]: Start difference. First operand 395 states and 555 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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-12 13:21:23,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:23,113 INFO L93 Difference]: Finished difference Result 509 states and 685 transitions. [2024-11-12 13:21:23,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 13:21:23,113 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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 22 [2024-11-12 13:21:23,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:23,115 INFO L225 Difference]: With dead ends: 509 [2024-11-12 13:21:23,115 INFO L226 Difference]: Without dead ends: 509 [2024-11-12 13:21:23,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-12 13:21:23,115 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 117 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:23,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1176 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:21:23,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2024-11-12 13:21:23,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 403. [2024-11-12 13:21:23,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 320 states have (on average 1.665625) internal successors, (533), 384 states have internal predecessors, (533), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2024-11-12 13:21:23,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 563 transitions. [2024-11-12 13:21:23,142 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 563 transitions. Word has length 22 [2024-11-12 13:21:23,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:23,143 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 563 transitions. [2024-11-12 13:21:23,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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-12 13:21:23,143 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 563 transitions. [2024-11-12 13:21:23,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-12 13:21:23,143 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:23,144 INFO L218 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] [2024-11-12 13:21:23,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 13:21:23,144 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:23,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:23,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1039595598, now seen corresponding path program 1 times [2024-11-12 13:21:23,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:23,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278777685] [2024-11-12 13:21:23,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:23,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:23,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:23,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 13:21:23,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:23,185 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-12 13:21:23,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:23,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278777685] [2024-11-12 13:21:23,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278777685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:23,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:23,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:21:23,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113307267] [2024-11-12 13:21:23,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:23,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:21:23,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:23,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:21:23,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:21:23,188 INFO L87 Difference]: Start difference. First operand 403 states and 563 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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-12 13:21:23,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:23,294 INFO L93 Difference]: Finished difference Result 408 states and 562 transitions. [2024-11-12 13:21:23,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:21:23,295 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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 23 [2024-11-12 13:21:23,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:23,296 INFO L225 Difference]: With dead ends: 408 [2024-11-12 13:21:23,296 INFO L226 Difference]: Without dead ends: 408 [2024-11-12 13:21:23,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:21:23,297 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 30 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:23,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 479 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:23,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2024-11-12 13:21:23,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 402. [2024-11-12 13:21:23,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 325 states have (on average 1.6123076923076922) internal successors, (524), 383 states have internal predecessors, (524), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2024-11-12 13:21:23,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 554 transitions. [2024-11-12 13:21:23,304 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 554 transitions. Word has length 23 [2024-11-12 13:21:23,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:23,305 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 554 transitions. [2024-11-12 13:21:23,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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-12 13:21:23,305 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 554 transitions. [2024-11-12 13:21:23,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-12 13:21:23,305 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:23,305 INFO L218 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] [2024-11-12 13:21:23,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 13:21:23,306 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:23,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:23,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1039595597, now seen corresponding path program 1 times [2024-11-12 13:21:23,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:23,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143541548] [2024-11-12 13:21:23,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:23,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:23,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:23,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 13:21:23,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:23,420 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-12 13:21:23,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:23,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143541548] [2024-11-12 13:21:23,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143541548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:23,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:23,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 13:21:23,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027412650] [2024-11-12 13:21:23,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:23,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:21:23,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:23,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:21:23,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:21:23,421 INFO L87 Difference]: Start difference. First operand 402 states and 554 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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-12 13:21:23,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:23,564 INFO L93 Difference]: Finished difference Result 325 states and 425 transitions. [2024-11-12 13:21:23,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 13:21:23,564 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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 23 [2024-11-12 13:21:23,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:23,565 INFO L225 Difference]: With dead ends: 325 [2024-11-12 13:21:23,565 INFO L226 Difference]: Without dead ends: 325 [2024-11-12 13:21:23,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-12 13:21:23,566 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 58 mSDsluCounter, 905 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:23,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1064 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:23,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-11-12 13:21:23,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 295. [2024-11-12 13:21:23,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 226 states have (on average 1.6371681415929205) internal successors, (370), 282 states have internal predecessors, (370), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-12 13:21:23,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 388 transitions. [2024-11-12 13:21:23,570 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 388 transitions. Word has length 23 [2024-11-12 13:21:23,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:23,570 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 388 transitions. [2024-11-12 13:21:23,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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-12 13:21:23,571 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 388 transitions. [2024-11-12 13:21:23,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-12 13:21:23,571 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:23,571 INFO L218 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] [2024-11-12 13:21:23,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-12 13:21:23,571 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:23,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:23,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1218800521, now seen corresponding path program 1 times [2024-11-12 13:21:23,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:23,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835935200] [2024-11-12 13:21:23,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:23,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:23,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:23,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:23,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:23,596 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-12 13:21:23,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:23,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835935200] [2024-11-12 13:21:23,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835935200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:23,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:23,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:21:23,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555848970] [2024-11-12 13:21:23,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:23,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:21:23,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:23,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:21:23,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:21:23,598 INFO L87 Difference]: Start difference. First operand 295 states and 388 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-12 13:21:23,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:23,613 INFO L93 Difference]: Finished difference Result 304 states and 397 transitions. [2024-11-12 13:21:23,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:21:23,613 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 25 [2024-11-12 13:21:23,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:23,614 INFO L225 Difference]: With dead ends: 304 [2024-11-12 13:21:23,614 INFO L226 Difference]: Without dead ends: 304 [2024-11-12 13:21:23,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-12 13:21:23,614 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 1 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:23,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 502 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:21:23,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-11-12 13:21:23,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2024-11-12 13:21:23,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 235 states have (on average 1.6127659574468085) internal successors, (379), 291 states have internal predecessors, (379), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-12 13:21:23,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 397 transitions. [2024-11-12 13:21:23,619 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 397 transitions. Word has length 25 [2024-11-12 13:21:23,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:23,619 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 397 transitions. [2024-11-12 13:21:23,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-12 13:21:23,619 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 397 transitions. [2024-11-12 13:21:23,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-12 13:21:23,620 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:23,620 INFO L218 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] [2024-11-12 13:21:23,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-12 13:21:23,620 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:23,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:23,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1220647563, now seen corresponding path program 1 times [2024-11-12 13:21:23,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:23,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031929927] [2024-11-12 13:21:23,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:23,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:23,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:23,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:23,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:23,673 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-12 13:21:23,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:23,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031929927] [2024-11-12 13:21:23,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031929927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:23,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:23,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:21:23,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752498326] [2024-11-12 13:21:23,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:23,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:21:23,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:23,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:21:23,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:21:23,675 INFO L87 Difference]: Start difference. First operand 304 states and 397 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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-12 13:21:23,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:23,749 INFO L93 Difference]: Finished difference Result 365 states and 478 transitions. [2024-11-12 13:21:23,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:21:23,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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 25 [2024-11-12 13:21:23,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:23,750 INFO L225 Difference]: With dead ends: 365 [2024-11-12 13:21:23,750 INFO L226 Difference]: Without dead ends: 365 [2024-11-12 13:21:23,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:21:23,751 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 67 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:23,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 258 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:23,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-11-12 13:21:23,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 359. [2024-11-12 13:21:23,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 291 states have (on average 1.5807560137457044) internal successors, (460), 346 states have internal predecessors, (460), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-12 13:21:23,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 478 transitions. [2024-11-12 13:21:23,757 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 478 transitions. Word has length 25 [2024-11-12 13:21:23,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:23,758 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 478 transitions. [2024-11-12 13:21:23,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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-12 13:21:23,758 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 478 transitions. [2024-11-12 13:21:23,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-12 13:21:23,758 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:23,758 INFO L218 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] [2024-11-12 13:21:23,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-12 13:21:23,759 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:23,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:23,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1220647562, now seen corresponding path program 1 times [2024-11-12 13:21:23,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:23,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133883017] [2024-11-12 13:21:23,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:23,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:23,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:23,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:23,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:23,781 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-12 13:21:23,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:23,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133883017] [2024-11-12 13:21:23,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133883017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:23,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:23,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:21:23,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990693745] [2024-11-12 13:21:23,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:23,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:21:23,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:23,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:21:23,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:21:23,783 INFO L87 Difference]: Start difference. First operand 359 states and 478 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 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-12 13:21:23,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:23,834 INFO L93 Difference]: Finished difference Result 356 states and 466 transitions. [2024-11-12 13:21:23,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:21:23,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 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 25 [2024-11-12 13:21:23,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:23,835 INFO L225 Difference]: With dead ends: 356 [2024-11-12 13:21:23,835 INFO L226 Difference]: Without dead ends: 356 [2024-11-12 13:21:23,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-12 13:21:23,836 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 28 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:23,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 238 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:21:23,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-11-12 13:21:23,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2024-11-12 13:21:23,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 291 states have (on average 1.5395189003436427) internal successors, (448), 343 states have internal predecessors, (448), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-12 13:21:23,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 466 transitions. [2024-11-12 13:21:23,841 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 466 transitions. Word has length 25 [2024-11-12 13:21:23,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:23,841 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 466 transitions. [2024-11-12 13:21:23,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 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-12 13:21:23,841 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 466 transitions. [2024-11-12 13:21:23,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-12 13:21:23,841 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:23,842 INFO L218 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] [2024-11-12 13:21:23,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-12 13:21:23,842 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:23,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:23,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1209666842, now seen corresponding path program 1 times [2024-11-12 13:21:23,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:23,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963808744] [2024-11-12 13:21:23,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:23,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:23,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:23,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:23,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:23,889 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-12 13:21:23,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:23,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963808744] [2024-11-12 13:21:23,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963808744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:23,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:23,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 13:21:23,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034127914] [2024-11-12 13:21:23,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:23,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 13:21:23,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:23,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 13:21:23,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:21:23,891 INFO L87 Difference]: Start difference. First operand 356 states and 466 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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-12 13:21:23,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:23,910 INFO L93 Difference]: Finished difference Result 403 states and 520 transitions. [2024-11-12 13:21:23,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:21:23,911 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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 26 [2024-11-12 13:21:23,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:23,912 INFO L225 Difference]: With dead ends: 403 [2024-11-12 13:21:23,912 INFO L226 Difference]: Without dead ends: 403 [2024-11-12 13:21:23,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:21:23,913 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 46 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:23,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 825 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:21:23,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-11-12 13:21:23,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 356. [2024-11-12 13:21:23,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 291 states have (on average 1.529209621993127) internal successors, (445), 343 states have internal predecessors, (445), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-12 13:21:23,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 463 transitions. [2024-11-12 13:21:23,917 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 463 transitions. Word has length 26 [2024-11-12 13:21:23,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:23,918 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 463 transitions. [2024-11-12 13:21:23,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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-12 13:21:23,918 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 463 transitions. [2024-11-12 13:21:23,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-12 13:21:23,918 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:23,918 INFO L218 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] [2024-11-12 13:21:23,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-12 13:21:23,919 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:23,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:23,919 INFO L85 PathProgramCache]: Analyzing trace with hash 2088228101, now seen corresponding path program 1 times [2024-11-12 13:21:23,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:23,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966757968] [2024-11-12 13:21:23,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:23,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:23,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:23,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:23,988 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-12 13:21:23,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:23,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966757968] [2024-11-12 13:21:23,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966757968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:23,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:23,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:21:23,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900756508] [2024-11-12 13:21:23,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:23,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:21:23,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:23,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:21:23,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:21:23,990 INFO L87 Difference]: Start difference. First operand 356 states and 463 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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-12 13:21:24,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:24,065 INFO L93 Difference]: Finished difference Result 418 states and 544 transitions. [2024-11-12 13:21:24,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:21:24,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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 26 [2024-11-12 13:21:24,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:24,067 INFO L225 Difference]: With dead ends: 418 [2024-11-12 13:21:24,067 INFO L226 Difference]: Without dead ends: 418 [2024-11-12 13:21:24,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:21:24,067 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 50 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:24,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 272 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:24,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2024-11-12 13:21:24,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 356. [2024-11-12 13:21:24,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 291 states have (on average 1.529209621993127) internal successors, (445), 343 states have internal predecessors, (445), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-12 13:21:24,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 463 transitions. [2024-11-12 13:21:24,072 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 463 transitions. Word has length 26 [2024-11-12 13:21:24,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:24,072 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 463 transitions. [2024-11-12 13:21:24,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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-12 13:21:24,073 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 463 transitions. [2024-11-12 13:21:24,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-12 13:21:24,073 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:24,073 INFO L218 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] [2024-11-12 13:21:24,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-12 13:21:24,073 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:24,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:24,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1505674617, now seen corresponding path program 1 times [2024-11-12 13:21:24,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:24,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427630946] [2024-11-12 13:21:24,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:24,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:24,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:24,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:24,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:24,121 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-12 13:21:24,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:24,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427630946] [2024-11-12 13:21:24,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427630946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:24,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:24,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 13:21:24,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363369114] [2024-11-12 13:21:24,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:24,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 13:21:24,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:24,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 13:21:24,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:21:24,123 INFO L87 Difference]: Start difference. First operand 356 states and 463 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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-12 13:21:24,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:24,139 INFO L93 Difference]: Finished difference Result 299 states and 376 transitions. [2024-11-12 13:21:24,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:21:24,139 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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 26 [2024-11-12 13:21:24,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:24,140 INFO L225 Difference]: With dead ends: 299 [2024-11-12 13:21:24,140 INFO L226 Difference]: Without dead ends: 299 [2024-11-12 13:21:24,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:21:24,141 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:24,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 835 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:21:24,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-11-12 13:21:24,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2024-11-12 13:21:24,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 235 states have (on average 1.523404255319149) internal successors, (358), 286 states have internal predecessors, (358), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-12 13:21:24,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 376 transitions. [2024-11-12 13:21:24,145 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 376 transitions. Word has length 26 [2024-11-12 13:21:24,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:24,145 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 376 transitions. [2024-11-12 13:21:24,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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-12 13:21:24,145 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 376 transitions. [2024-11-12 13:21:24,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-12 13:21:24,146 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:24,146 INFO L218 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] [2024-11-12 13:21:24,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-12 13:21:24,146 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:24,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:24,147 INFO L85 PathProgramCache]: Analyzing trace with hash 516237483, now seen corresponding path program 1 times [2024-11-12 13:21:24,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:24,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159358386] [2024-11-12 13:21:24,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:24,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:24,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:24,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:24,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:24,221 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-12 13:21:24,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:24,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159358386] [2024-11-12 13:21:24,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159358386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:24,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:24,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 13:21:24,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217812385] [2024-11-12 13:21:24,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:24,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 13:21:24,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:24,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 13:21:24,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:21:24,223 INFO L87 Difference]: Start difference. First operand 299 states and 376 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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-12 13:21:24,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:24,319 INFO L93 Difference]: Finished difference Result 334 states and 417 transitions. [2024-11-12 13:21:24,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 13:21:24,320 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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 27 [2024-11-12 13:21:24,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:24,320 INFO L225 Difference]: With dead ends: 334 [2024-11-12 13:21:24,320 INFO L226 Difference]: Without dead ends: 334 [2024-11-12 13:21:24,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-12 13:21:24,321 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 16 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:24,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 709 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:24,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-11-12 13:21:24,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 329. [2024-11-12 13:21:24,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 265 states have (on average 1.4830188679245282) internal successors, (393), 316 states have internal predecessors, (393), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-12 13:21:24,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 411 transitions. [2024-11-12 13:21:24,325 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 411 transitions. Word has length 27 [2024-11-12 13:21:24,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:24,326 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 411 transitions. [2024-11-12 13:21:24,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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-12 13:21:24,326 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 411 transitions. [2024-11-12 13:21:24,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-12 13:21:24,326 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:24,326 INFO L218 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] [2024-11-12 13:21:24,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-12 13:21:24,327 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:24,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:24,327 INFO L85 PathProgramCache]: Analyzing trace with hash 516237677, now seen corresponding path program 1 times [2024-11-12 13:21:24,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:24,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384946367] [2024-11-12 13:21:24,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:24,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:24,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:24,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:24,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:24,383 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-12 13:21:24,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:24,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384946367] [2024-11-12 13:21:24,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384946367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:24,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:24,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:21:24,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610307860] [2024-11-12 13:21:24,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:24,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:21:24,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:24,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:21:24,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:21:24,385 INFO L87 Difference]: Start difference. First operand 329 states and 411 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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-12 13:21:24,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:24,419 INFO L93 Difference]: Finished difference Result 440 states and 551 transitions. [2024-11-12 13:21:24,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:21:24,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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 27 [2024-11-12 13:21:24,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:24,420 INFO L225 Difference]: With dead ends: 440 [2024-11-12 13:21:24,420 INFO L226 Difference]: Without dead ends: 440 [2024-11-12 13:21:24,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:21:24,421 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 80 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:24,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 328 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:21:24,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-11-12 13:21:24,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 415. [2024-11-12 13:21:24,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 351 states have (on average 1.4672364672364673) internal successors, (515), 402 states have internal predecessors, (515), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-12 13:21:24,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 533 transitions. [2024-11-12 13:21:24,426 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 533 transitions. Word has length 27 [2024-11-12 13:21:24,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:24,426 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 533 transitions. [2024-11-12 13:21:24,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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-12 13:21:24,427 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 533 transitions. [2024-11-12 13:21:24,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-12 13:21:24,427 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:24,427 INFO L218 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] [2024-11-12 13:21:24,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-12 13:21:24,427 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:24,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:24,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1037479271, now seen corresponding path program 1 times [2024-11-12 13:21:24,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:24,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141504058] [2024-11-12 13:21:24,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:24,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:24,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:24,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:24,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:24,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-12 13:21:24,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:24,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141504058] [2024-11-12 13:21:24,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141504058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:24,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:24,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:21:24,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854477213] [2024-11-12 13:21:24,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:24,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:21:24,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:24,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:21:24,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:21:24,485 INFO L87 Difference]: Start difference. First operand 415 states and 533 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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-12 13:21:24,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:24,572 INFO L93 Difference]: Finished difference Result 440 states and 545 transitions. [2024-11-12 13:21:24,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:21:24,573 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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 28 [2024-11-12 13:21:24,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:24,574 INFO L225 Difference]: With dead ends: 440 [2024-11-12 13:21:24,574 INFO L226 Difference]: Without dead ends: 440 [2024-11-12 13:21:24,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:21:24,574 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 57 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:24,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 365 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:24,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-11-12 13:21:24,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 328. [2024-11-12 13:21:24,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 265 states have (on average 1.460377358490566) internal successors, (387), 315 states have internal predecessors, (387), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-12 13:21:24,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 405 transitions. [2024-11-12 13:21:24,579 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 405 transitions. Word has length 28 [2024-11-12 13:21:24,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:24,580 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 405 transitions. [2024-11-12 13:21:24,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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-12 13:21:24,580 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 405 transitions. [2024-11-12 13:21:24,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-12 13:21:24,580 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:24,580 INFO L218 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, 1, 1, 1, 1, 1] [2024-11-12 13:21:24,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-12 13:21:24,581 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:24,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:24,581 INFO L85 PathProgramCache]: Analyzing trace with hash -734692199, now seen corresponding path program 1 times [2024-11-12 13:21:24,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:24,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212329408] [2024-11-12 13:21:24,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:24,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:24,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:24,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:24,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:24,631 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-12 13:21:24,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:24,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212329408] [2024-11-12 13:21:24,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212329408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:24,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:24,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 13:21:24,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814942742] [2024-11-12 13:21:24,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:24,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 13:21:24,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:24,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 13:21:24,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:21:24,633 INFO L87 Difference]: Start difference. First operand 328 states and 405 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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-12 13:21:24,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:24,743 INFO L93 Difference]: Finished difference Result 329 states and 405 transitions. [2024-11-12 13:21:24,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:21:24,744 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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 35 [2024-11-12 13:21:24,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:24,745 INFO L225 Difference]: With dead ends: 329 [2024-11-12 13:21:24,745 INFO L226 Difference]: Without dead ends: 329 [2024-11-12 13:21:24,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:21:24,745 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 52 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:24,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 533 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:24,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-11-12 13:21:24,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 327. [2024-11-12 13:21:24,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 265 states have (on average 1.4528301886792452) internal successors, (385), 314 states have internal predecessors, (385), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-12 13:21:24,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 403 transitions. [2024-11-12 13:21:24,749 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 403 transitions. Word has length 35 [2024-11-12 13:21:24,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:24,750 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 403 transitions. [2024-11-12 13:21:24,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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-12 13:21:24,750 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 403 transitions. [2024-11-12 13:21:24,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-12 13:21:24,750 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:24,750 INFO L218 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, 1, 1, 1, 1, 1] [2024-11-12 13:21:24,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-12 13:21:24,768 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:24,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:24,769 INFO L85 PathProgramCache]: Analyzing trace with hash -734692198, now seen corresponding path program 1 times [2024-11-12 13:21:24,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:24,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145405590] [2024-11-12 13:21:24,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:24,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:24,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:24,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:24,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:24,876 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-12 13:21:24,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:24,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145405590] [2024-11-12 13:21:24,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145405590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:24,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:24,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 13:21:24,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606300434] [2024-11-12 13:21:24,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:24,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 13:21:24,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:24,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 13:21:24,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:21:24,878 INFO L87 Difference]: Start difference. First operand 327 states and 403 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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-12 13:21:24,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:24,993 INFO L93 Difference]: Finished difference Result 328 states and 403 transitions. [2024-11-12 13:21:24,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:21:24,993 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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 35 [2024-11-12 13:21:24,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:24,994 INFO L225 Difference]: With dead ends: 328 [2024-11-12 13:21:24,994 INFO L226 Difference]: Without dead ends: 328 [2024-11-12 13:21:24,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:21:24,995 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 40 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:24,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 537 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:24,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-11-12 13:21:24,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 326. [2024-11-12 13:21:24,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 265 states have (on average 1.4452830188679244) internal successors, (383), 313 states have internal predecessors, (383), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-12 13:21:24,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 401 transitions. [2024-11-12 13:21:24,999 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 401 transitions. Word has length 35 [2024-11-12 13:21:25,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:25,000 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 401 transitions. [2024-11-12 13:21:25,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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-12 13:21:25,000 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 401 transitions. [2024-11-12 13:21:25,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-12 13:21:25,000 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:25,000 INFO L218 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:25,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-12 13:21:25,001 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:25,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:25,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1664563334, now seen corresponding path program 1 times [2024-11-12 13:21:25,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:25,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375285286] [2024-11-12 13:21:25,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:25,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:25,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:25,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:25,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:25,062 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-12 13:21:25,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:25,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375285286] [2024-11-12 13:21:25,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375285286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:25,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:25,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:21:25,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669535588] [2024-11-12 13:21:25,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:25,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:21:25,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:25,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:21:25,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:21:25,064 INFO L87 Difference]: Start difference. First operand 326 states and 401 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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-12 13:21:25,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:25,160 INFO L93 Difference]: Finished difference Result 369 states and 451 transitions. [2024-11-12 13:21:25,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:21:25,160 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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 37 [2024-11-12 13:21:25,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:25,162 INFO L225 Difference]: With dead ends: 369 [2024-11-12 13:21:25,162 INFO L226 Difference]: Without dead ends: 369 [2024-11-12 13:21:25,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:21:25,162 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 100 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:25,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 341 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:25,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-11-12 13:21:25,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 323. [2024-11-12 13:21:25,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 265 states have (on average 1.4226415094339622) internal successors, (377), 310 states have internal predecessors, (377), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-12 13:21:25,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 395 transitions. [2024-11-12 13:21:25,166 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 395 transitions. Word has length 37 [2024-11-12 13:21:25,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:25,167 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 395 transitions. [2024-11-12 13:21:25,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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-12 13:21:25,167 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 395 transitions. [2024-11-12 13:21:25,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-12 13:21:25,167 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:25,167 INFO L218 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:25,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-12 13:21:25,167 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:25,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:25,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1664563333, now seen corresponding path program 1 times [2024-11-12 13:21:25,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:25,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058990065] [2024-11-12 13:21:25,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:25,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:25,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:25,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:25,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:25,277 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-12 13:21:25,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:25,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058990065] [2024-11-12 13:21:25,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058990065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:25,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:25,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 13:21:25,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776023744] [2024-11-12 13:21:25,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:25,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 13:21:25,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:25,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 13:21:25,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:21:25,279 INFO L87 Difference]: Start difference. First operand 323 states and 395 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 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-12 13:21:25,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:25,446 INFO L93 Difference]: Finished difference Result 368 states and 449 transitions. [2024-11-12 13:21:25,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:21:25,446 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 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 37 [2024-11-12 13:21:25,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:25,447 INFO L225 Difference]: With dead ends: 368 [2024-11-12 13:21:25,447 INFO L226 Difference]: Without dead ends: 368 [2024-11-12 13:21:25,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-12 13:21:25,448 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 289 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:25,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 416 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:25,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-11-12 13:21:25,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 322. [2024-11-12 13:21:25,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 265 states have (on average 1.4150943396226414) internal successors, (375), 309 states have internal predecessors, (375), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-12 13:21:25,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 393 transitions. [2024-11-12 13:21:25,452 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 393 transitions. Word has length 37 [2024-11-12 13:21:25,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:25,452 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 393 transitions. [2024-11-12 13:21:25,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 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-12 13:21:25,453 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 393 transitions. [2024-11-12 13:21:25,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-12 13:21:25,453 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:25,453 INFO L218 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:25,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-12 13:21:25,453 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:25,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:25,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1664563172, now seen corresponding path program 1 times [2024-11-12 13:21:25,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:25,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335836545] [2024-11-12 13:21:25,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:25,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:25,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:25,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:25,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:25,665 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-12 13:21:25,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:25,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335836545] [2024-11-12 13:21:25,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335836545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:25,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:25,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:21:25,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863759176] [2024-11-12 13:21:25,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:25,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:21:25,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:25,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:21:25,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:21:25,669 INFO L87 Difference]: Start difference. First operand 322 states and 393 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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-12 13:21:26,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:26,071 INFO L93 Difference]: Finished difference Result 389 states and 444 transitions. [2024-11-12 13:21:26,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:21:26,073 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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 37 [2024-11-12 13:21:26,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:26,074 INFO L225 Difference]: With dead ends: 389 [2024-11-12 13:21:26,074 INFO L226 Difference]: Without dead ends: 389 [2024-11-12 13:21:26,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:21:26,075 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 192 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:26,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 283 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 13:21:26,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-11-12 13:21:26,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 322. [2024-11-12 13:21:26,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 265 states have (on average 1.4075471698113207) internal successors, (373), 309 states have internal predecessors, (373), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-12 13:21:26,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 391 transitions. [2024-11-12 13:21:26,085 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 391 transitions. Word has length 37 [2024-11-12 13:21:26,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:26,085 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 391 transitions. [2024-11-12 13:21:26,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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-12 13:21:26,085 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 391 transitions. [2024-11-12 13:21:26,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-12 13:21:26,085 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:26,085 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:26,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-12 13:21:26,086 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:26,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:26,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1071259938, now seen corresponding path program 1 times [2024-11-12 13:21:26,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:26,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907911738] [2024-11-12 13:21:26,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:26,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:26,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:26,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:26,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:26,210 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:26,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:26,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907911738] [2024-11-12 13:21:26,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907911738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:26,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:26,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 13:21:26,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065001384] [2024-11-12 13:21:26,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:26,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 13:21:26,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:26,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 13:21:26,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:21:26,211 INFO L87 Difference]: Start difference. First operand 322 states and 391 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 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-12 13:21:26,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:26,306 INFO L93 Difference]: Finished difference Result 326 states and 395 transitions. [2024-11-12 13:21:26,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:21:26,306 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 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 48 [2024-11-12 13:21:26,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:26,307 INFO L225 Difference]: With dead ends: 326 [2024-11-12 13:21:26,308 INFO L226 Difference]: Without dead ends: 326 [2024-11-12 13:21:26,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:21:26,308 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 129 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:26,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 278 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:26,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-11-12 13:21:26,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 323. [2024-11-12 13:21:26,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 267 states have (on average 1.404494382022472) internal successors, (375), 310 states have internal predecessors, (375), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-12 13:21:26,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 393 transitions. [2024-11-12 13:21:26,312 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 393 transitions. Word has length 48 [2024-11-12 13:21:26,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:26,312 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 393 transitions. [2024-11-12 13:21:26,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 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-12 13:21:26,313 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 393 transitions. [2024-11-12 13:21:26,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-12 13:21:26,313 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:26,313 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:26,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-12 13:21:26,313 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:26,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:26,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1071260000, now seen corresponding path program 1 times [2024-11-12 13:21:26,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:26,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026668528] [2024-11-12 13:21:26,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:26,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:26,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:26,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:26,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:26,416 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:26,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:26,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026668528] [2024-11-12 13:21:26,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026668528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:26,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:26,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 13:21:26,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288046367] [2024-11-12 13:21:26,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:26,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 13:21:26,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:26,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 13:21:26,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:21:26,417 INFO L87 Difference]: Start difference. First operand 323 states and 393 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 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-12 13:21:26,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:26,535 INFO L93 Difference]: Finished difference Result 325 states and 393 transitions. [2024-11-12 13:21:26,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:21:26,535 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 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 48 [2024-11-12 13:21:26,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:26,536 INFO L225 Difference]: With dead ends: 325 [2024-11-12 13:21:26,536 INFO L226 Difference]: Without dead ends: 325 [2024-11-12 13:21:26,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:21:26,537 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 240 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:26,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 310 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:26,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-11-12 13:21:26,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 320. [2024-11-12 13:21:26,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 265 states have (on average 1.3962264150943395) internal successors, (370), 307 states have internal predecessors, (370), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-12 13:21:26,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 388 transitions. [2024-11-12 13:21:26,543 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 388 transitions. Word has length 48 [2024-11-12 13:21:26,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:26,543 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 388 transitions. [2024-11-12 13:21:26,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 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-12 13:21:26,543 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 388 transitions. [2024-11-12 13:21:26,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-12 13:21:26,544 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:26,544 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:26,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-12 13:21:26,544 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:26,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:26,544 INFO L85 PathProgramCache]: Analyzing trace with hash 122043664, now seen corresponding path program 1 times [2024-11-12 13:21:26,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:26,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714171030] [2024-11-12 13:21:26,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:26,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:26,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:26,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:26,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:26,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 13:21:26,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:26,694 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 13:21:26,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:26,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714171030] [2024-11-12 13:21:26,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714171030] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:21:26,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057309029] [2024-11-12 13:21:26,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:26,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:21:26,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:21:26,698 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-12 13:21:26,699 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-12 13:21:26,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:26,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-12 13:21:26,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:21:27,047 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:27,047 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:21:27,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057309029] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:27,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 13:21:27,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 9 [2024-11-12 13:21:27,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092451884] [2024-11-12 13:21:27,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:27,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 13:21:27,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:27,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 13:21:27,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-12 13:21:27,049 INFO L87 Difference]: Start difference. First operand 320 states and 388 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-12 13:21:27,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:27,154 INFO L93 Difference]: Finished difference Result 320 states and 387 transitions. [2024-11-12 13:21:27,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:21:27,155 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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) Word has length 50 [2024-11-12 13:21:27,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:27,156 INFO L225 Difference]: With dead ends: 320 [2024-11-12 13:21:27,156 INFO L226 Difference]: Without dead ends: 320 [2024-11-12 13:21:27,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-12 13:21:27,156 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 184 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:27,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 265 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:27,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-11-12 13:21:27,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 318. [2024-11-12 13:21:27,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 265 states have (on average 1.3849056603773584) internal successors, (367), 305 states have internal predecessors, (367), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-12 13:21:27,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 385 transitions. [2024-11-12 13:21:27,160 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 385 transitions. Word has length 50 [2024-11-12 13:21:27,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:27,161 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 385 transitions. [2024-11-12 13:21:27,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-12 13:21:27,161 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 385 transitions. [2024-11-12 13:21:27,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-12 13:21:27,161 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:27,161 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:27,175 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-12 13:21:27,362 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,SelfDestructingSolverStorable34 [2024-11-12 13:21:27,363 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:27,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:27,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1996957779, now seen corresponding path program 1 times [2024-11-12 13:21:27,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:27,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718521420] [2024-11-12 13:21:27,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:27,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:27,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:27,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:27,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:27,661 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:27,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:27,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718521420] [2024-11-12 13:21:27,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718521420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:27,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:27,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 13:21:27,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730723818] [2024-11-12 13:21:27,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:27,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 13:21:27,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:27,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 13:21:27,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-12 13:21:27,663 INFO L87 Difference]: Start difference. First operand 318 states and 385 transitions. Second operand has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 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-12 13:21:28,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:28,049 INFO L93 Difference]: Finished difference Result 657 states and 807 transitions. [2024-11-12 13:21:28,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 13:21:28,050 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 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 51 [2024-11-12 13:21:28,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:28,051 INFO L225 Difference]: With dead ends: 657 [2024-11-12 13:21:28,051 INFO L226 Difference]: Without dead ends: 657 [2024-11-12 13:21:28,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2024-11-12 13:21:28,052 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 419 mSDsluCounter, 1066 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 1211 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:28,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 1211 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 13:21:28,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2024-11-12 13:21:28,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 464. [2024-11-12 13:21:28,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 404 states have (on average 1.381188118811881) internal successors, (558), 447 states have internal predecessors, (558), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2024-11-12 13:21:28,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 588 transitions. [2024-11-12 13:21:28,058 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 588 transitions. Word has length 51 [2024-11-12 13:21:28,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:28,058 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 588 transitions. [2024-11-12 13:21:28,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 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-12 13:21:28,059 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 588 transitions. [2024-11-12 13:21:28,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-12 13:21:28,059 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:28,059 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:28,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-12 13:21:28,059 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:28,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:28,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1996957778, now seen corresponding path program 1 times [2024-11-12 13:21:28,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:28,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479006492] [2024-11-12 13:21:28,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:28,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:28,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:28,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:28,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:28,423 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:28,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:28,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479006492] [2024-11-12 13:21:28,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479006492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:28,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:28,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 13:21:28,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762990395] [2024-11-12 13:21:28,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:28,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 13:21:28,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:28,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 13:21:28,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-12 13:21:28,425 INFO L87 Difference]: Start difference. First operand 464 states and 588 transitions. Second operand has 11 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 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-12 13:21:28,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:28,824 INFO L93 Difference]: Finished difference Result 700 states and 866 transitions. [2024-11-12 13:21:28,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 13:21:28,825 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 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 51 [2024-11-12 13:21:28,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:28,826 INFO L225 Difference]: With dead ends: 700 [2024-11-12 13:21:28,827 INFO L226 Difference]: Without dead ends: 700 [2024-11-12 13:21:28,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2024-11-12 13:21:28,827 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 333 mSDsluCounter, 926 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:28,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 1065 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 13:21:28,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2024-11-12 13:21:28,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 514. [2024-11-12 13:21:28,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 450 states have (on average 1.3977777777777778) internal successors, (629), 495 states have internal predecessors, (629), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2024-11-12 13:21:28,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 665 transitions. [2024-11-12 13:21:28,835 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 665 transitions. Word has length 51 [2024-11-12 13:21:28,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:28,835 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 665 transitions. [2024-11-12 13:21:28,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 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-12 13:21:28,835 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 665 transitions. [2024-11-12 13:21:28,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-12 13:21:28,836 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:28,836 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:28,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-12 13:21:28,836 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:28,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:28,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1995110737, now seen corresponding path program 1 times [2024-11-12 13:21:28,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:28,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464632997] [2024-11-12 13:21:28,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:28,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:29,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:29,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:29,438 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:29,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:29,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464632997] [2024-11-12 13:21:29,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464632997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:29,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:29,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-12 13:21:29,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108216765] [2024-11-12 13:21:29,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:29,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 13:21:29,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:29,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 13:21:29,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-12 13:21:29,440 INFO L87 Difference]: Start difference. First operand 514 states and 665 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 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-12 13:21:29,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:29,883 INFO L93 Difference]: Finished difference Result 543 states and 695 transitions. [2024-11-12 13:21:29,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 13:21:29,883 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 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 51 [2024-11-12 13:21:29,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:29,885 INFO L225 Difference]: With dead ends: 543 [2024-11-12 13:21:29,885 INFO L226 Difference]: Without dead ends: 543 [2024-11-12 13:21:29,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-11-12 13:21:29,885 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 77 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:29,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1153 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 13:21:29,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2024-11-12 13:21:29,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 534. [2024-11-12 13:21:29,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 470 states have (on average 1.3829787234042554) internal successors, (650), 515 states have internal predecessors, (650), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2024-11-12 13:21:29,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 686 transitions. [2024-11-12 13:21:29,892 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 686 transitions. Word has length 51 [2024-11-12 13:21:29,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:29,892 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 686 transitions. [2024-11-12 13:21:29,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 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-12 13:21:29,893 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 686 transitions. [2024-11-12 13:21:29,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-12 13:21:29,893 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:29,893 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:29,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-12 13:21:29,893 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:29,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:29,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1999969648, now seen corresponding path program 1 times [2024-11-12 13:21:29,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:29,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402444968] [2024-11-12 13:21:29,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:29,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:29,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:30,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:30,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:30,372 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:30,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:30,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402444968] [2024-11-12 13:21:30,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402444968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:30,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:30,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-12 13:21:30,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116244038] [2024-11-12 13:21:30,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:30,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 13:21:30,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:30,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 13:21:30,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-12 13:21:30,375 INFO L87 Difference]: Start difference. First operand 534 states and 686 transitions. Second operand has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 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-12 13:21:30,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:30,777 INFO L93 Difference]: Finished difference Result 800 states and 1010 transitions. [2024-11-12 13:21:30,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-12 13:21:30,778 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 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 52 [2024-11-12 13:21:30,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:30,780 INFO L225 Difference]: With dead ends: 800 [2024-11-12 13:21:30,780 INFO L226 Difference]: Without dead ends: 800 [2024-11-12 13:21:30,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2024-11-12 13:21:30,781 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 410 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:30,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 1245 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 13:21:30,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2024-11-12 13:21:30,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 597. [2024-11-12 13:21:30,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 525 states have (on average 1.380952380952381) internal successors, (725), 574 states have internal predecessors, (725), 16 states have call successors, (16), 8 states have call predecessors, (16), 16 states have return successors, (32), 14 states have call predecessors, (32), 16 states have call successors, (32) [2024-11-12 13:21:30,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 773 transitions. [2024-11-12 13:21:30,789 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 773 transitions. Word has length 52 [2024-11-12 13:21:30,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:30,790 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 773 transitions. [2024-11-12 13:21:30,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 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-12 13:21:30,790 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 773 transitions. [2024-11-12 13:21:30,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-12 13:21:30,790 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:30,790 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:30,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-12 13:21:30,791 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:30,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:30,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1999969647, now seen corresponding path program 1 times [2024-11-12 13:21:30,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:30,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585784025] [2024-11-12 13:21:30,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:30,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:30,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:31,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:31,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:31,484 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:31,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:31,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585784025] [2024-11-12 13:21:31,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585784025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:31,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:31,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-12 13:21:31,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034220596] [2024-11-12 13:21:31,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:31,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 13:21:31,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:31,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 13:21:31,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-12 13:21:31,485 INFO L87 Difference]: Start difference. First operand 597 states and 773 transitions. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 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-12 13:21:32,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:32,191 INFO L93 Difference]: Finished difference Result 689 states and 856 transitions. [2024-11-12 13:21:32,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 13:21:32,192 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 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 52 [2024-11-12 13:21:32,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:32,193 INFO L225 Difference]: With dead ends: 689 [2024-11-12 13:21:32,193 INFO L226 Difference]: Without dead ends: 689 [2024-11-12 13:21:32,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2024-11-12 13:21:32,194 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 256 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:32,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 1027 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 13:21:32,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2024-11-12 13:21:32,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 600. [2024-11-12 13:21:32,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 528 states have (on average 1.3768939393939394) internal successors, (727), 577 states have internal predecessors, (727), 16 states have call successors, (16), 8 states have call predecessors, (16), 16 states have return successors, (32), 14 states have call predecessors, (32), 16 states have call successors, (32) [2024-11-12 13:21:32,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 775 transitions. [2024-11-12 13:21:32,208 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 775 transitions. Word has length 52 [2024-11-12 13:21:32,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:32,209 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 775 transitions. [2024-11-12 13:21:32,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 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-12 13:21:32,209 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 775 transitions. [2024-11-12 13:21:32,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-12 13:21:32,209 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:32,209 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:32,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-12 13:21:32,210 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:32,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:32,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1818456665, now seen corresponding path program 1 times [2024-11-12 13:21:32,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:32,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434830875] [2024-11-12 13:21:32,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:32,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:32,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:32,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:32,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:32,962 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:32,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:32,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434830875] [2024-11-12 13:21:32,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434830875] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:21:32,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939750110] [2024-11-12 13:21:32,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:32,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:21:32,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:21:32,964 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-12 13:21:32,973 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-12 13:21:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:33,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-12 13:21:33,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:21:33,342 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:21:33,343 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-12 13:21:33,609 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 16 treesize of output 11 [2024-11-12 13:21:33,622 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 16 treesize of output 11 [2024-11-12 13:21:33,649 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 16 treesize of output 11 [2024-11-12 13:21:33,655 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 16 treesize of output 11 [2024-11-12 13:21:33,689 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 16 treesize of output 11 [2024-11-12 13:21:33,694 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 16 treesize of output 11 [2024-11-12 13:21:33,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:21:33,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-12 13:21:33,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:21:33,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-12 13:21:33,906 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:33,907 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:21:34,041 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_482 (Array Int Int)) (|ULTIMATE.start_create_item_~head~0#1.base| Int)) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_item_~item~0#1.base| v_ArrVal_482))) (store .cse0 |c_ULTIMATE.start_create_item_~cursor#1.base| (store (select .cse0 |c_ULTIMATE.start_create_item_~cursor#1.base|) |c_ULTIMATE.start_create_item_~cursor#1.offset| |ULTIMATE.start_create_item_~head~0#1.base|))) |c_~#list~0.base|) |c_~#list~0.offset|) 0)) (forall ((v_ArrVal_481 (Array Int Int)) (v_ArrVal_483 Int)) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_item_~item~0#1.base| v_ArrVal_481))) (store .cse1 |c_ULTIMATE.start_create_item_~cursor#1.base| (store (select .cse1 |c_ULTIMATE.start_create_item_~cursor#1.base|) |c_ULTIMATE.start_create_item_~cursor#1.offset| v_ArrVal_483))) |c_~#list~0.base|) |c_~#list~0.offset|) 0))) is different from false [2024-11-12 13:21:36,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939750110] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:21:36,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:21:36,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 22 [2024-11-12 13:21:36,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863921933] [2024-11-12 13:21:36,067 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:21:36,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-12 13:21:36,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:36,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-12 13:21:36,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=584, Unknown=3, NotChecked=50, Total=756 [2024-11-12 13:21:36,068 INFO L87 Difference]: Start difference. First operand 600 states and 775 transitions. Second operand has 22 states, 22 states have (on average 4.136363636363637) internal successors, (91), 20 states have internal predecessors, (91), 1 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-12 13:21:36,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:36,937 INFO L93 Difference]: Finished difference Result 928 states and 1156 transitions. [2024-11-12 13:21:36,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-12 13:21:36,937 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.136363636363637) internal successors, (91), 20 states have internal predecessors, (91), 1 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 52 [2024-11-12 13:21:36,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:36,939 INFO L225 Difference]: With dead ends: 928 [2024-11-12 13:21:36,939 INFO L226 Difference]: Without dead ends: 928 [2024-11-12 13:21:36,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=245, Invalid=1162, Unknown=3, NotChecked=72, Total=1482 [2024-11-12 13:21:36,940 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 379 mSDsluCounter, 1876 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 2022 SdHoareTripleChecker+Invalid, 1117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:36,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 2022 Invalid, 1117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1090 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 13:21:36,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2024-11-12 13:21:36,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 721. [2024-11-12 13:21:36,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 641 states have (on average 1.3775351014040562) internal successors, (883), 693 states have internal predecessors, (883), 20 states have call successors, (20), 10 states have call predecessors, (20), 20 states have return successors, (40), 17 states have call predecessors, (40), 20 states have call successors, (40) [2024-11-12 13:21:36,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 943 transitions. [2024-11-12 13:21:36,951 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 943 transitions. Word has length 52 [2024-11-12 13:21:36,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:36,951 INFO L471 AbstractCegarLoop]: Abstraction has 721 states and 943 transitions. [2024-11-12 13:21:36,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.136363636363637) internal successors, (91), 20 states have internal predecessors, (91), 1 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-12 13:21:36,951 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 943 transitions. [2024-11-12 13:21:36,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-12 13:21:36,952 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:36,952 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:36,968 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-12 13:21:37,156 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,SelfDestructingSolverStorable40 [2024-11-12 13:21:37,157 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:37,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:37,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1816609623, now seen corresponding path program 1 times [2024-11-12 13:21:37,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:37,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818938342] [2024-11-12 13:21:37,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:37,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:37,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:37,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:37,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:37,593 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:37,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:37,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818938342] [2024-11-12 13:21:37,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818938342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:37,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:37,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 13:21:37,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737324416] [2024-11-12 13:21:37,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:37,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 13:21:37,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:37,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 13:21:37,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-12 13:21:37,595 INFO L87 Difference]: Start difference. First operand 721 states and 943 transitions. Second operand has 11 states, 10 states have (on average 5.0) internal successors, (50), 11 states have internal predecessors, (50), 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-12 13:21:38,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:38,074 INFO L93 Difference]: Finished difference Result 1067 states and 1373 transitions. [2024-11-12 13:21:38,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 13:21:38,074 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.0) internal successors, (50), 11 states have internal predecessors, (50), 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 52 [2024-11-12 13:21:38,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:38,077 INFO L225 Difference]: With dead ends: 1067 [2024-11-12 13:21:38,077 INFO L226 Difference]: Without dead ends: 1067 [2024-11-12 13:21:38,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2024-11-12 13:21:38,077 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 204 mSDsluCounter, 1053 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 1244 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:38,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 1244 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 13:21:38,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2024-11-12 13:21:38,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 822. [2024-11-12 13:21:38,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 734 states have (on average 1.38283378746594) internal successors, (1015), 790 states have internal predecessors, (1015), 24 states have call successors, (24), 12 states have call predecessors, (24), 24 states have return successors, (48), 19 states have call predecessors, (48), 24 states have call successors, (48) [2024-11-12 13:21:38,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1087 transitions. [2024-11-12 13:21:38,088 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1087 transitions. Word has length 52 [2024-11-12 13:21:38,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:38,088 INFO L471 AbstractCegarLoop]: Abstraction has 822 states and 1087 transitions. [2024-11-12 13:21:38,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.0) internal successors, (50), 11 states have internal predecessors, (50), 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-12 13:21:38,088 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1087 transitions. [2024-11-12 13:21:38,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-12 13:21:38,089 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:38,089 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:38,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-12 13:21:38,089 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:38,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:38,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1816609622, now seen corresponding path program 1 times [2024-11-12 13:21:38,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:38,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500178991] [2024-11-12 13:21:38,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:38,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:38,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:38,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:38,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:38,819 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:38,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:38,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500178991] [2024-11-12 13:21:38,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500178991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:38,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:38,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-12 13:21:38,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876212342] [2024-11-12 13:21:38,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:38,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-12 13:21:38,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:38,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-12 13:21:38,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2024-11-12 13:21:38,821 INFO L87 Difference]: Start difference. First operand 822 states and 1087 transitions. Second operand has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 states have internal predecessors, (50), 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-12 13:21:39,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:39,506 INFO L93 Difference]: Finished difference Result 810 states and 1022 transitions. [2024-11-12 13:21:39,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-12 13:21:39,506 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 states have internal predecessors, (50), 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 52 [2024-11-12 13:21:39,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:39,508 INFO L225 Difference]: With dead ends: 810 [2024-11-12 13:21:39,508 INFO L226 Difference]: Without dead ends: 810 [2024-11-12 13:21:39,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=848, Unknown=0, NotChecked=0, Total=992 [2024-11-12 13:21:39,511 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 237 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 1485 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:39,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 1485 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1010 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 13:21:39,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2024-11-12 13:21:39,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 689. [2024-11-12 13:21:39,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 609 states have (on average 1.3908045977011494) internal successors, (847), 662 states have internal predecessors, (847), 20 states have call successors, (20), 10 states have call predecessors, (20), 20 states have return successors, (40), 16 states have call predecessors, (40), 20 states have call successors, (40) [2024-11-12 13:21:39,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 907 transitions. [2024-11-12 13:21:39,521 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 907 transitions. Word has length 52 [2024-11-12 13:21:39,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:39,522 INFO L471 AbstractCegarLoop]: Abstraction has 689 states and 907 transitions. [2024-11-12 13:21:39,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 states have internal predecessors, (50), 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-12 13:21:39,522 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 907 transitions. [2024-11-12 13:21:39,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-12 13:21:39,523 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:39,523 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:39,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-12 13:21:39,523 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:39,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:39,524 INFO L85 PathProgramCache]: Analyzing trace with hash -939923179, now seen corresponding path program 1 times [2024-11-12 13:21:39,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:39,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966539073] [2024-11-12 13:21:39,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:39,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:39,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:39,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:39,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:40,005 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:40,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:40,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966539073] [2024-11-12 13:21:40,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966539073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:40,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:40,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-12 13:21:40,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515948706] [2024-11-12 13:21:40,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:40,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-12 13:21:40,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:40,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-12 13:21:40,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2024-11-12 13:21:40,007 INFO L87 Difference]: Start difference. First operand 689 states and 907 transitions. Second operand has 17 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 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-12 13:21:40,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:40,455 INFO L93 Difference]: Finished difference Result 1000 states and 1292 transitions. [2024-11-12 13:21:40,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-12 13:21:40,456 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 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 53 [2024-11-12 13:21:40,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:40,458 INFO L225 Difference]: With dead ends: 1000 [2024-11-12 13:21:40,458 INFO L226 Difference]: Without dead ends: 1000 [2024-11-12 13:21:40,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2024-11-12 13:21:40,459 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 482 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:40,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 1316 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 13:21:40,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2024-11-12 13:21:40,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 712. [2024-11-12 13:21:40,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 632 states have (on average 1.3813291139240507) internal successors, (873), 685 states have internal predecessors, (873), 20 states have call successors, (20), 10 states have call predecessors, (20), 20 states have return successors, (40), 16 states have call predecessors, (40), 20 states have call successors, (40) [2024-11-12 13:21:40,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 933 transitions. [2024-11-12 13:21:40,469 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 933 transitions. Word has length 53 [2024-11-12 13:21:40,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:40,469 INFO L471 AbstractCegarLoop]: Abstraction has 712 states and 933 transitions. [2024-11-12 13:21:40,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 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-12 13:21:40,469 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 933 transitions. [2024-11-12 13:21:40,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-12 13:21:40,469 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:40,470 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:40,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-12 13:21:40,470 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:40,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:40,470 INFO L85 PathProgramCache]: Analyzing trace with hash -939923178, now seen corresponding path program 1 times [2024-11-12 13:21:40,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:40,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248273843] [2024-11-12 13:21:40,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:40,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:40,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:41,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:41,138 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:41,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:41,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248273843] [2024-11-12 13:21:41,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248273843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:41,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:41,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-12 13:21:41,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637882447] [2024-11-12 13:21:41,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:41,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-12 13:21:41,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:41,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-12 13:21:41,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-12 13:21:41,140 INFO L87 Difference]: Start difference. First operand 712 states and 933 transitions. Second operand has 18 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 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-12 13:21:41,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:41,937 INFO L93 Difference]: Finished difference Result 970 states and 1246 transitions. [2024-11-12 13:21:41,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-12 13:21:41,937 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 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 53 [2024-11-12 13:21:41,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:41,939 INFO L225 Difference]: With dead ends: 970 [2024-11-12 13:21:41,939 INFO L226 Difference]: Without dead ends: 970 [2024-11-12 13:21:41,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2024-11-12 13:21:41,940 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 440 mSDsluCounter, 1800 mSDsCounter, 0 mSdLazyCounter, 1323 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 1937 SdHoareTripleChecker+Invalid, 1330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:41,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 1937 Invalid, 1330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1323 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 13:21:41,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2024-11-12 13:21:41,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 654. [2024-11-12 13:21:41,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 582 states have (on average 1.379725085910653) internal successors, (803), 631 states have internal predecessors, (803), 16 states have call successors, (16), 8 states have call predecessors, (16), 16 states have return successors, (32), 14 states have call predecessors, (32), 16 states have call successors, (32) [2024-11-12 13:21:41,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 851 transitions. [2024-11-12 13:21:41,948 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 851 transitions. Word has length 53 [2024-11-12 13:21:41,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:41,948 INFO L471 AbstractCegarLoop]: Abstraction has 654 states and 851 transitions. [2024-11-12 13:21:41,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 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-12 13:21:41,948 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 851 transitions. [2024-11-12 13:21:41,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-12 13:21:41,949 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:41,949 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:41,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-12 13:21:41,949 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:41,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:41,950 INFO L85 PathProgramCache]: Analyzing trace with hash -938076137, now seen corresponding path program 1 times [2024-11-12 13:21:41,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:41,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773566576] [2024-11-12 13:21:41,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:41,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:42,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:42,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:42,180 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:42,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:42,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773566576] [2024-11-12 13:21:42,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773566576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:42,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:42,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 13:21:42,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644570745] [2024-11-12 13:21:42,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:42,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 13:21:42,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:42,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 13:21:42,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-12 13:21:42,182 INFO L87 Difference]: Start difference. First operand 654 states and 851 transitions. Second operand has 11 states, 10 states have (on average 5.1) internal successors, (51), 11 states have internal predecessors, (51), 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-12 13:21:42,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:42,585 INFO L93 Difference]: Finished difference Result 979 states and 1274 transitions. [2024-11-12 13:21:42,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 13:21:42,585 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 11 states have internal predecessors, (51), 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 53 [2024-11-12 13:21:42,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:42,587 INFO L225 Difference]: With dead ends: 979 [2024-11-12 13:21:42,587 INFO L226 Difference]: Without dead ends: 979 [2024-11-12 13:21:42,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-12 13:21:42,588 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 205 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:42,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 854 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 13:21:42,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2024-11-12 13:21:42,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 708. [2024-11-12 13:21:42,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 628 states have (on average 1.3789808917197452) internal successors, (866), 681 states have internal predecessors, (866), 20 states have call successors, (20), 10 states have call predecessors, (20), 20 states have return successors, (40), 16 states have call predecessors, (40), 20 states have call successors, (40) [2024-11-12 13:21:42,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 926 transitions. [2024-11-12 13:21:42,598 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 926 transitions. Word has length 53 [2024-11-12 13:21:42,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:42,598 INFO L471 AbstractCegarLoop]: Abstraction has 708 states and 926 transitions. [2024-11-12 13:21:42,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 11 states have internal predecessors, (51), 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-12 13:21:42,598 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 926 transitions. [2024-11-12 13:21:42,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-12 13:21:42,599 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:42,599 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:42,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-12 13:21:42,599 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:42,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:42,599 INFO L85 PathProgramCache]: Analyzing trace with hash -938076136, now seen corresponding path program 1 times [2024-11-12 13:21:42,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:42,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309669991] [2024-11-12 13:21:42,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:42,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:42,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:44,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:44,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:44,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:44,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:44,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309669991] [2024-11-12 13:21:44,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309669991] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:21:44,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387482008] [2024-11-12 13:21:44,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:44,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:21:44,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:21:44,053 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-12 13:21:44,054 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-12 13:21:44,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:44,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-12 13:21:44,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:21:44,234 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-12 13:21:44,599 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-12 13:21:44,602 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-12 13:21:44,790 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:21:44,791 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-12 13:21:44,794 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:21:44,794 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-12 13:21:44,856 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:44,856 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:21:44,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387482008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:44,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 13:21:44,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [21] total 31 [2024-11-12 13:21:44,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806870241] [2024-11-12 13:21:44,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:44,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 13:21:44,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:44,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 13:21:44,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=898, Unknown=0, NotChecked=0, Total=992 [2024-11-12 13:21:44,858 INFO L87 Difference]: Start difference. First operand 708 states and 926 transitions. Second operand has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 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-12 13:21:45,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:45,354 INFO L93 Difference]: Finished difference Result 1132 states and 1490 transitions. [2024-11-12 13:21:45,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 13:21:45,354 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 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 53 [2024-11-12 13:21:45,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:45,357 INFO L225 Difference]: With dead ends: 1132 [2024-11-12 13:21:45,357 INFO L226 Difference]: Without dead ends: 1132 [2024-11-12 13:21:45,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=109, Invalid=1081, Unknown=0, NotChecked=0, Total=1190 [2024-11-12 13:21:45,358 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 341 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:45,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 1171 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 13:21:45,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2024-11-12 13:21:45,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 916. [2024-11-12 13:21:45,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 812 states have (on average 1.3990147783251232) internal successors, (1136), 877 states have internal predecessors, (1136), 32 states have call successors, (32), 16 states have call predecessors, (32), 32 states have return successors, (64), 22 states have call predecessors, (64), 32 states have call successors, (64) [2024-11-12 13:21:45,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1232 transitions. [2024-11-12 13:21:45,376 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1232 transitions. Word has length 53 [2024-11-12 13:21:45,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:45,376 INFO L471 AbstractCegarLoop]: Abstraction has 916 states and 1232 transitions. [2024-11-12 13:21:45,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 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-12 13:21:45,377 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1232 transitions. [2024-11-12 13:21:45,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-12 13:21:45,377 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:45,377 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:45,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-12 13:21:45,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:21:45,578 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:45,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:45,579 INFO L85 PathProgramCache]: Analyzing trace with hash -271818071, now seen corresponding path program 1 times [2024-11-12 13:21:45,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:45,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350300215] [2024-11-12 13:21:45,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:45,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:45,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:45,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:45,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:45,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-12 13:21:45,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:45,716 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 13:21:45,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:45,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350300215] [2024-11-12 13:21:45,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350300215] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:21:45,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234395242] [2024-11-12 13:21:45,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:45,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:21:45,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:21:45,718 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-12 13:21:45,722 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-12 13:21:45,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:45,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-12 13:21:45,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:21:46,085 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:46,086 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:21:46,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234395242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:46,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 13:21:46,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 14 [2024-11-12 13:21:46,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460976623] [2024-11-12 13:21:46,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:46,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:21:46,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:46,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:21:46,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-12 13:21:46,087 INFO L87 Difference]: Start difference. First operand 916 states and 1232 transitions. Second operand has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 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-12 13:21:46,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:46,236 INFO L93 Difference]: Finished difference Result 921 states and 1223 transitions. [2024-11-12 13:21:46,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:21:46,236 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 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) Word has length 54 [2024-11-12 13:21:46,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:46,238 INFO L225 Difference]: With dead ends: 921 [2024-11-12 13:21:46,238 INFO L226 Difference]: Without dead ends: 921 [2024-11-12 13:21:46,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2024-11-12 13:21:46,239 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 270 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:46,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 363 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:21:46,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2024-11-12 13:21:46,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 915. [2024-11-12 13:21:46,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 812 states have (on average 1.3805418719211822) internal successors, (1121), 876 states have internal predecessors, (1121), 32 states have call successors, (32), 16 states have call predecessors, (32), 32 states have return successors, (64), 22 states have call predecessors, (64), 32 states have call successors, (64) [2024-11-12 13:21:46,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1217 transitions. [2024-11-12 13:21:46,251 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1217 transitions. Word has length 54 [2024-11-12 13:21:46,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:46,251 INFO L471 AbstractCegarLoop]: Abstraction has 915 states and 1217 transitions. [2024-11-12 13:21:46,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 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-12 13:21:46,252 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1217 transitions. [2024-11-12 13:21:46,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-12 13:21:46,254 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:46,255 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:46,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-12 13:21:46,458 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,SelfDestructingSolverStorable47 [2024-11-12 13:21:46,459 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:46,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:46,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1139837490, now seen corresponding path program 1 times [2024-11-12 13:21:46,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:46,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324942234] [2024-11-12 13:21:46,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:46,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:46,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:46,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:46,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:46,687 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:46,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:46,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324942234] [2024-11-12 13:21:46,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324942234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:46,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:46,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-12 13:21:46,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299442519] [2024-11-12 13:21:46,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:46,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 13:21:46,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:46,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 13:21:46,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-12 13:21:46,689 INFO L87 Difference]: Start difference. First operand 915 states and 1217 transitions. Second operand has 13 states, 12 states have (on average 4.25) internal successors, (51), 13 states have internal predecessors, (51), 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-12 13:21:47,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:47,021 INFO L93 Difference]: Finished difference Result 1267 states and 1681 transitions. [2024-11-12 13:21:47,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 13:21:47,021 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 13 states have internal predecessors, (51), 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 53 [2024-11-12 13:21:47,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:47,024 INFO L225 Difference]: With dead ends: 1267 [2024-11-12 13:21:47,024 INFO L226 Difference]: Without dead ends: 1267 [2024-11-12 13:21:47,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2024-11-12 13:21:47,025 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 293 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:47,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 1074 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 13:21:47,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2024-11-12 13:21:47,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 969. [2024-11-12 13:21:47,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 858 states have (on average 1.3776223776223777) internal successors, (1182), 926 states have internal predecessors, (1182), 36 states have call successors, (36), 18 states have call predecessors, (36), 36 states have return successors, (72), 24 states have call predecessors, (72), 36 states have call successors, (72) [2024-11-12 13:21:47,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1290 transitions. [2024-11-12 13:21:47,036 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1290 transitions. Word has length 53 [2024-11-12 13:21:47,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:47,036 INFO L471 AbstractCegarLoop]: Abstraction has 969 states and 1290 transitions. [2024-11-12 13:21:47,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 13 states have internal predecessors, (51), 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-12 13:21:47,037 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1290 transitions. [2024-11-12 13:21:47,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-12 13:21:47,037 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:47,037 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:47,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-11-12 13:21:47,037 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:47,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:47,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1139837489, now seen corresponding path program 1 times [2024-11-12 13:21:47,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:47,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618038858] [2024-11-12 13:21:47,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:47,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:47,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:47,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:47,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:47,344 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:47,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:47,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618038858] [2024-11-12 13:21:47,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618038858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:47,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:47,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 13:21:47,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265685234] [2024-11-12 13:21:47,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:47,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 13:21:47,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:47,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 13:21:47,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-12 13:21:47,346 INFO L87 Difference]: Start difference. First operand 969 states and 1290 transitions. Second operand has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 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-12 13:21:47,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:47,715 INFO L93 Difference]: Finished difference Result 1334 states and 1769 transitions. [2024-11-12 13:21:47,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 13:21:47,716 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 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 53 [2024-11-12 13:21:47,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:47,719 INFO L225 Difference]: With dead ends: 1334 [2024-11-12 13:21:47,719 INFO L226 Difference]: Without dead ends: 1334 [2024-11-12 13:21:47,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2024-11-12 13:21:47,719 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 401 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:47,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 1053 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 13:21:47,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2024-11-12 13:21:47,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 792. [2024-11-12 13:21:47,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 701 states have (on average 1.383737517831669) internal successors, (970), 759 states have internal predecessors, (970), 26 states have call successors, (26), 13 states have call predecessors, (26), 26 states have return successors, (52), 19 states have call predecessors, (52), 26 states have call successors, (52) [2024-11-12 13:21:47,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1048 transitions. [2024-11-12 13:21:47,730 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1048 transitions. Word has length 53 [2024-11-12 13:21:47,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:47,730 INFO L471 AbstractCegarLoop]: Abstraction has 792 states and 1048 transitions. [2024-11-12 13:21:47,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 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-12 13:21:47,730 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1048 transitions. [2024-11-12 13:21:47,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-12 13:21:47,731 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:47,731 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:47,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-11-12 13:21:47,731 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:47,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:47,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1137990448, now seen corresponding path program 1 times [2024-11-12 13:21:47,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:47,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558190272] [2024-11-12 13:21:47,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:47,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:47,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:48,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:48,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:48,084 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:48,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:48,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558190272] [2024-11-12 13:21:48,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558190272] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:21:48,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315370522] [2024-11-12 13:21:48,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:48,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:21:48,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:21:48,087 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-12 13:21:48,087 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-12 13:21:48,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:48,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-12 13:21:48,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:21:48,450 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-12 13:21:48,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:21:48,562 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 29 treesize of output 22 [2024-11-12 13:21:48,684 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:21:48,684 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-12 13:21:48,688 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:48,688 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:21:48,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315370522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:48,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 13:21:48,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14] total 25 [2024-11-12 13:21:48,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914257881] [2024-11-12 13:21:48,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:48,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-12 13:21:48,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:48,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-12 13:21:48,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2024-11-12 13:21:48,689 INFO L87 Difference]: Start difference. First operand 792 states and 1048 transitions. Second operand has 15 states, 14 states have (on average 3.642857142857143) internal successors, (51), 13 states have internal predecessors, (51), 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-12 13:21:49,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:49,357 INFO L93 Difference]: Finished difference Result 1157 states and 1503 transitions. [2024-11-12 13:21:49,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-12 13:21:49,357 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.642857142857143) internal successors, (51), 13 states have internal predecessors, (51), 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 53 [2024-11-12 13:21:49,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:49,360 INFO L225 Difference]: With dead ends: 1157 [2024-11-12 13:21:49,360 INFO L226 Difference]: Without dead ends: 1157 [2024-11-12 13:21:49,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=923, Unknown=0, NotChecked=0, Total=1056 [2024-11-12 13:21:49,362 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 280 mSDsluCounter, 2194 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 2471 SdHoareTripleChecker+Invalid, 1301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:49,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 2471 Invalid, 1301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1296 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 13:21:49,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2024-11-12 13:21:49,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 815. [2024-11-12 13:21:49,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 815 states, 724 states have (on average 1.3756906077348066) internal successors, (996), 782 states have internal predecessors, (996), 26 states have call successors, (26), 13 states have call predecessors, (26), 26 states have return successors, (52), 19 states have call predecessors, (52), 26 states have call successors, (52) [2024-11-12 13:21:49,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1074 transitions. [2024-11-12 13:21:49,371 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1074 transitions. Word has length 53 [2024-11-12 13:21:49,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:49,372 INFO L471 AbstractCegarLoop]: Abstraction has 815 states and 1074 transitions. [2024-11-12 13:21:49,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.642857142857143) internal successors, (51), 13 states have internal predecessors, (51), 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-12 13:21:49,372 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1074 transitions. [2024-11-12 13:21:49,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-12 13:21:49,372 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:49,373 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:49,390 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-12 13:21:49,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:21:49,576 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:49,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:49,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1137990447, now seen corresponding path program 1 times [2024-11-12 13:21:49,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:49,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971557484] [2024-11-12 13:21:49,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:49,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:49,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:50,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:50,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:50,181 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:50,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:50,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971557484] [2024-11-12 13:21:50,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971557484] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:21:50,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734780356] [2024-11-12 13:21:50,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:50,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:21:50,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:21:50,182 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-12 13:21:50,186 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-12 13:21:50,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:50,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-12 13:21:50,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:21:50,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 8 treesize of output 1 [2024-11-12 13:21:50,748 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-12 13:21:50,752 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 15 treesize of output 1 [2024-11-12 13:21:50,817 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 25 treesize of output 13 [2024-11-12 13:21:50,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-12 13:21:50,933 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 17 treesize of output 9 [2024-11-12 13:21:50,944 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:50,944 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:21:50,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734780356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:50,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 13:21:50,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 21 [2024-11-12 13:21:50,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568961946] [2024-11-12 13:21:50,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:50,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 13:21:50,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:50,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 13:21:50,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2024-11-12 13:21:50,945 INFO L87 Difference]: Start difference. First operand 815 states and 1074 transitions. Second operand has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 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-12 13:21:51,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:51,573 INFO L93 Difference]: Finished difference Result 1237 states and 1618 transitions. [2024-11-12 13:21:51,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 13:21:51,574 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 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 53 [2024-11-12 13:21:51,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:51,580 INFO L225 Difference]: With dead ends: 1237 [2024-11-12 13:21:51,580 INFO L226 Difference]: Without dead ends: 1237 [2024-11-12 13:21:51,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2024-11-12 13:21:51,580 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 304 mSDsluCounter, 1617 mSDsCounter, 0 mSdLazyCounter, 1071 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 1897 SdHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:51,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 1897 Invalid, 1074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1071 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 13:21:51,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2024-11-12 13:21:51,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 913. [2024-11-12 13:21:51,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 810 states have (on average 1.3814814814814815) internal successors, (1119), 874 states have internal predecessors, (1119), 32 states have call successors, (32), 16 states have call predecessors, (32), 32 states have return successors, (64), 22 states have call predecessors, (64), 32 states have call successors, (64) [2024-11-12 13:21:51,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1215 transitions. [2024-11-12 13:21:51,599 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1215 transitions. Word has length 53 [2024-11-12 13:21:51,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:51,599 INFO L471 AbstractCegarLoop]: Abstraction has 913 states and 1215 transitions. [2024-11-12 13:21:51,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 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-12 13:21:51,599 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1215 transitions. [2024-11-12 13:21:51,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-12 13:21:51,600 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:51,600 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:51,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-12 13:21:51,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:21:51,800 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:51,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:51,801 INFO L85 PathProgramCache]: Analyzing trace with hash 927151265, now seen corresponding path program 1 times [2024-11-12 13:21:51,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:51,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477191365] [2024-11-12 13:21:51,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:51,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:51,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:52,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:52,167 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:52,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:52,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477191365] [2024-11-12 13:21:52,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477191365] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:21:52,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583180404] [2024-11-12 13:21:52,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:52,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:21:52,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:21:52,170 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-12 13:21:52,175 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-12 13:21:52,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:52,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-12 13:21:52,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:21:52,602 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-12 13:21:52,658 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 26 treesize of output 21 [2024-11-12 13:21:52,814 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:21:52,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 11 [2024-11-12 13:21:52,818 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:52,818 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:21:52,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583180404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:52,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 13:21:52,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [14] total 22 [2024-11-12 13:21:52,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623004139] [2024-11-12 13:21:52,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:52,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 13:21:52,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:52,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 13:21:52,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2024-11-12 13:21:52,819 INFO L87 Difference]: Start difference. First operand 913 states and 1215 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 11 states have internal predecessors, (52), 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-12 13:21:53,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:53,147 INFO L93 Difference]: Finished difference Result 1221 states and 1607 transitions. [2024-11-12 13:21:53,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 13:21:53,148 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 11 states have internal predecessors, (52), 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 54 [2024-11-12 13:21:53,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:53,149 INFO L225 Difference]: With dead ends: 1221 [2024-11-12 13:21:53,149 INFO L226 Difference]: Without dead ends: 1221 [2024-11-12 13:21:53,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2024-11-12 13:21:53,150 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 290 mSDsluCounter, 1173 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:53,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 1329 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 468 Invalid, 1 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 13:21:53,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2024-11-12 13:21:53,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 1018. [2024-11-12 13:21:53,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 903 states have (on average 1.3853820598006645) internal successors, (1251), 973 states have internal predecessors, (1251), 38 states have call successors, (38), 19 states have call predecessors, (38), 38 states have return successors, (76), 25 states have call predecessors, (76), 38 states have call successors, (76) [2024-11-12 13:21:53,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1365 transitions. [2024-11-12 13:21:53,160 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1365 transitions. Word has length 54 [2024-11-12 13:21:53,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:53,160 INFO L471 AbstractCegarLoop]: Abstraction has 1018 states and 1365 transitions. [2024-11-12 13:21:53,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 11 states have internal predecessors, (52), 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-12 13:21:53,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1365 transitions. [2024-11-12 13:21:53,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-12 13:21:53,162 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:53,162 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:53,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-12 13:21:53,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:21:53,366 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:53,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:53,366 INFO L85 PathProgramCache]: Analyzing trace with hash 984409567, now seen corresponding path program 1 times [2024-11-12 13:21:53,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:53,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034408551] [2024-11-12 13:21:53,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:53,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:53,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:53,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:53,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:53,602 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:53,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:53,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034408551] [2024-11-12 13:21:53,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034408551] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:21:53,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316180459] [2024-11-12 13:21:53,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:53,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:21:53,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:21:53,604 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-12 13:21:53,605 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-12 13:21:53,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:53,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-12 13:21:53,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:21:54,018 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-12 13:21:54,136 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:21:54,137 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2024-11-12 13:21:54,140 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:54,140 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:21:54,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316180459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:54,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 13:21:54,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 20 [2024-11-12 13:21:54,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95832527] [2024-11-12 13:21:54,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:54,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 13:21:54,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:54,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 13:21:54,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2024-11-12 13:21:54,141 INFO L87 Difference]: Start difference. First operand 1018 states and 1365 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 11 states have internal predecessors, (52), 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-12 13:21:54,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:54,481 INFO L93 Difference]: Finished difference Result 1221 states and 1605 transitions. [2024-11-12 13:21:54,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 13:21:54,481 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 11 states have internal predecessors, (52), 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 54 [2024-11-12 13:21:54,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:54,483 INFO L225 Difference]: With dead ends: 1221 [2024-11-12 13:21:54,483 INFO L226 Difference]: Without dead ends: 1221 [2024-11-12 13:21:54,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2024-11-12 13:21:54,484 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 272 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 1318 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:54,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 1318 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 13:21:54,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2024-11-12 13:21:54,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 1018. [2024-11-12 13:21:54,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 903 states have (on average 1.3853820598006645) internal successors, (1251), 973 states have internal predecessors, (1251), 38 states have call successors, (38), 19 states have call predecessors, (38), 38 states have return successors, (76), 25 states have call predecessors, (76), 38 states have call successors, (76) [2024-11-12 13:21:54,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1365 transitions. [2024-11-12 13:21:54,495 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1365 transitions. Word has length 54 [2024-11-12 13:21:54,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:54,496 INFO L471 AbstractCegarLoop]: Abstraction has 1018 states and 1365 transitions. [2024-11-12 13:21:54,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 11 states have internal predecessors, (52), 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-12 13:21:54,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1365 transitions. [2024-11-12 13:21:54,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-12 13:21:54,496 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:54,496 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:54,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-12 13:21:54,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2024-11-12 13:21:54,701 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:54,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:54,701 INFO L85 PathProgramCache]: Analyzing trace with hash -975225080, now seen corresponding path program 1 times [2024-11-12 13:21:54,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:54,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642315113] [2024-11-12 13:21:54,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:54,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:54,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:54,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:54,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:54,893 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:54,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:54,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642315113] [2024-11-12 13:21:54,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642315113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:54,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:54,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-12 13:21:54,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275938879] [2024-11-12 13:21:54,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:54,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 13:21:54,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:54,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 13:21:54,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-12 13:21:54,896 INFO L87 Difference]: Start difference. First operand 1018 states and 1365 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 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-12 13:21:55,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:55,135 INFO L93 Difference]: Finished difference Result 1335 states and 1768 transitions. [2024-11-12 13:21:55,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 13:21:55,135 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 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 54 [2024-11-12 13:21:55,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:55,137 INFO L225 Difference]: With dead ends: 1335 [2024-11-12 13:21:55,137 INFO L226 Difference]: Without dead ends: 1335 [2024-11-12 13:21:55,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2024-11-12 13:21:55,138 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 372 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:55,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 1306 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:21:55,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2024-11-12 13:21:55,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1116. [2024-11-12 13:21:55,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 989 states have (on average 1.3892821031344793) internal successors, (1374), 1065 states have internal predecessors, (1374), 44 states have call successors, (44), 22 states have call predecessors, (44), 44 states have return successors, (88), 28 states have call predecessors, (88), 44 states have call successors, (88) [2024-11-12 13:21:55,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1506 transitions. [2024-11-12 13:21:55,147 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1506 transitions. Word has length 54 [2024-11-12 13:21:55,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:55,148 INFO L471 AbstractCegarLoop]: Abstraction has 1116 states and 1506 transitions. [2024-11-12 13:21:55,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 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-12 13:21:55,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1506 transitions. [2024-11-12 13:21:55,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-12 13:21:55,148 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:55,148 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:55,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-11-12 13:21:55,149 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:55,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:55,149 INFO L85 PathProgramCache]: Analyzing trace with hash -917966778, now seen corresponding path program 1 times [2024-11-12 13:21:55,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:55,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501062706] [2024-11-12 13:21:55,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:55,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:55,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:55,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:55,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:55,306 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:55,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:55,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501062706] [2024-11-12 13:21:55,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501062706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:55,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:55,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 13:21:55,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444460213] [2024-11-12 13:21:55,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:55,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:21:55,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:55,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:21:55,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:21:55,307 INFO L87 Difference]: Start difference. First operand 1116 states and 1506 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 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-12 13:21:55,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:55,491 INFO L93 Difference]: Finished difference Result 1420 states and 1901 transitions. [2024-11-12 13:21:55,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 13:21:55,491 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 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 54 [2024-11-12 13:21:55,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:55,497 INFO L225 Difference]: With dead ends: 1420 [2024-11-12 13:21:55,497 INFO L226 Difference]: Without dead ends: 1420 [2024-11-12 13:21:55,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-12 13:21:55,498 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 139 mSDsluCounter, 1098 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:55,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 1329 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:21:55,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2024-11-12 13:21:55,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1110. [2024-11-12 13:21:55,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 987 states have (on average 1.3981762917933132) internal successors, (1380), 1061 states have internal predecessors, (1380), 42 states have call successors, (42), 21 states have call predecessors, (42), 42 states have return successors, (84), 27 states have call predecessors, (84), 42 states have call successors, (84) [2024-11-12 13:21:55,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1506 transitions. [2024-11-12 13:21:55,511 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1506 transitions. Word has length 54 [2024-11-12 13:21:55,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:55,511 INFO L471 AbstractCegarLoop]: Abstraction has 1110 states and 1506 transitions. [2024-11-12 13:21:55,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 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-12 13:21:55,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1506 transitions. [2024-11-12 13:21:55,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-12 13:21:55,511 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:55,511 INFO L218 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, 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-12 13:21:55,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-11-12 13:21:55,511 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:55,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:55,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1935592645, now seen corresponding path program 1 times [2024-11-12 13:21:55,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:55,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943143647] [2024-11-12 13:21:55,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:55,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:55,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:55,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:55,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:55,951 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:55,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:55,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943143647] [2024-11-12 13:21:55,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943143647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:55,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:55,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-12 13:21:55,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935100071] [2024-11-12 13:21:55,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:55,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-12 13:21:55,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:55,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-12 13:21:55,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2024-11-12 13:21:55,953 INFO L87 Difference]: Start difference. First operand 1110 states and 1506 transitions. Second operand has 16 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 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-12 13:21:56,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:56,449 INFO L93 Difference]: Finished difference Result 1545 states and 2066 transitions. [2024-11-12 13:21:56,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-12 13:21:56,449 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 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 56 [2024-11-12 13:21:56,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:56,451 INFO L225 Difference]: With dead ends: 1545 [2024-11-12 13:21:56,452 INFO L226 Difference]: Without dead ends: 1545 [2024-11-12 13:21:56,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2024-11-12 13:21:56,452 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 498 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 1357 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:56,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 1357 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 13:21:56,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2024-11-12 13:21:56,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1326. [2024-11-12 13:21:56,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1326 states, 1179 states have (on average 1.4011874469889738) internal successors, (1652), 1265 states have internal predecessors, (1652), 54 states have call successors, (54), 27 states have call predecessors, (54), 54 states have return successors, (108), 33 states have call predecessors, (108), 54 states have call successors, (108) [2024-11-12 13:21:56,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 1814 transitions. [2024-11-12 13:21:56,463 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 1814 transitions. Word has length 56 [2024-11-12 13:21:56,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:56,463 INFO L471 AbstractCegarLoop]: Abstraction has 1326 states and 1814 transitions. [2024-11-12 13:21:56,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 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-12 13:21:56,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 1814 transitions. [2024-11-12 13:21:56,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-12 13:21:56,464 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:56,464 INFO L218 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, 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-12 13:21:56,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-11-12 13:21:56,464 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:56,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:56,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1126246019, now seen corresponding path program 1 times [2024-11-12 13:21:56,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:56,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756916076] [2024-11-12 13:21:56,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:56,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:56,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:56,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:56,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:56,623 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:56,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:56,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756916076] [2024-11-12 13:21:56,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756916076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:56,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:56,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 13:21:56,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093974774] [2024-11-12 13:21:56,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:56,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 13:21:56,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:56,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 13:21:56,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-12 13:21:56,624 INFO L87 Difference]: Start difference. First operand 1326 states and 1814 transitions. Second operand has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 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-12 13:21:56,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:56,878 INFO L93 Difference]: Finished difference Result 1704 states and 2309 transitions. [2024-11-12 13:21:56,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 13:21:56,878 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 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 56 [2024-11-12 13:21:56,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:56,880 INFO L225 Difference]: With dead ends: 1704 [2024-11-12 13:21:56,881 INFO L226 Difference]: Without dead ends: 1704 [2024-11-12 13:21:56,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-12 13:21:56,881 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 154 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:56,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 949 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:21:56,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1704 states. [2024-11-12 13:21:56,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1704 to 1474. [2024-11-12 13:21:56,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1474 states, 1311 states have (on average 1.4096109839816933) internal successors, (1848), 1405 states have internal predecessors, (1848), 62 states have call successors, (62), 31 states have call predecessors, (62), 62 states have return successors, (124), 37 states have call predecessors, (124), 62 states have call successors, (124) [2024-11-12 13:21:56,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2034 transitions. [2024-11-12 13:21:56,895 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 2034 transitions. Word has length 56 [2024-11-12 13:21:56,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:56,895 INFO L471 AbstractCegarLoop]: Abstraction has 1474 states and 2034 transitions. [2024-11-12 13:21:56,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 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-12 13:21:56,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 2034 transitions. [2024-11-12 13:21:56,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-12 13:21:56,896 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:56,896 INFO L218 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, 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-12 13:21:56,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-11-12 13:21:56,896 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:56,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:56,896 INFO L85 PathProgramCache]: Analyzing trace with hash -886974100, now seen corresponding path program 1 times [2024-11-12 13:21:56,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:56,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620239389] [2024-11-12 13:21:56,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:56,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:56,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:57,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:57,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:57,097 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:57,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:57,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620239389] [2024-11-12 13:21:57,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620239389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:57,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:57,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 13:21:57,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876294032] [2024-11-12 13:21:57,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:57,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 13:21:57,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:57,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 13:21:57,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-12 13:21:57,098 INFO L87 Difference]: Start difference. First operand 1474 states and 2034 transitions. Second operand has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 12 states have internal predecessors, (54), 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-12 13:21:57,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:57,379 INFO L93 Difference]: Finished difference Result 1703 states and 2305 transitions. [2024-11-12 13:21:57,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 13:21:57,379 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 12 states have internal predecessors, (54), 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 56 [2024-11-12 13:21:57,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:57,381 INFO L225 Difference]: With dead ends: 1703 [2024-11-12 13:21:57,381 INFO L226 Difference]: Without dead ends: 1703 [2024-11-12 13:21:57,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-11-12 13:21:57,382 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 284 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:57,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 995 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:21:57,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2024-11-12 13:21:57,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1270. [2024-11-12 13:21:57,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1270 states, 1131 states have (on average 1.4067197170645447) internal successors, (1591), 1213 states have internal predecessors, (1591), 50 states have call successors, (50), 25 states have call predecessors, (50), 50 states have return successors, (100), 31 states have call predecessors, (100), 50 states have call successors, (100) [2024-11-12 13:21:57,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1741 transitions. [2024-11-12 13:21:57,394 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1741 transitions. Word has length 56 [2024-11-12 13:21:57,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:57,394 INFO L471 AbstractCegarLoop]: Abstraction has 1270 states and 1741 transitions. [2024-11-12 13:21:57,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 12 states have internal predecessors, (54), 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-12 13:21:57,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1741 transitions. [2024-11-12 13:21:57,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-12 13:21:57,395 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:57,395 INFO L218 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, 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-12 13:21:57,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-11-12 13:21:57,395 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:57,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:57,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1696320726, now seen corresponding path program 1 times [2024-11-12 13:21:57,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:57,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898736273] [2024-11-12 13:21:57,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:57,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:57,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:57,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:57,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:57,811 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:57,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:57,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898736273] [2024-11-12 13:21:57,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898736273] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:21:57,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131047512] [2024-11-12 13:21:57,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:57,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:21:57,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:21:57,814 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-12 13:21:57,817 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-12 13:21:57,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:57,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-12 13:21:57,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:21:58,251 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-12 13:21:58,294 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 15 [2024-11-12 13:21:58,355 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-12 13:21:58,362 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:21:58,362 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:21:58,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131047512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:58,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 13:21:58,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 20 [2024-11-12 13:21:58,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163481458] [2024-11-12 13:21:58,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:58,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 13:21:58,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:58,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 13:21:58,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2024-11-12 13:21:58,363 INFO L87 Difference]: Start difference. First operand 1270 states and 1741 transitions. Second operand has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 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-12 13:21:58,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:58,847 INFO L93 Difference]: Finished difference Result 1487 states and 1987 transitions. [2024-11-12 13:21:58,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-12 13:21:58,848 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 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 56 [2024-11-12 13:21:58,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:58,850 INFO L225 Difference]: With dead ends: 1487 [2024-11-12 13:21:58,850 INFO L226 Difference]: Without dead ends: 1487 [2024-11-12 13:21:58,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2024-11-12 13:21:58,851 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 299 mSDsluCounter, 1777 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 2019 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:58,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 2019 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 13:21:58,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2024-11-12 13:21:58,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1161. [2024-11-12 13:21:58,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 1034 states have (on average 1.4061895551257253) internal successors, (1454), 1110 states have internal predecessors, (1454), 44 states have call successors, (44), 22 states have call predecessors, (44), 44 states have return successors, (88), 28 states have call predecessors, (88), 44 states have call successors, (88) [2024-11-12 13:21:58,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1586 transitions. [2024-11-12 13:21:58,861 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1586 transitions. Word has length 56 [2024-11-12 13:21:58,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:58,862 INFO L471 AbstractCegarLoop]: Abstraction has 1161 states and 1586 transitions. [2024-11-12 13:21:58,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 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-12 13:21:58,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1586 transitions. [2024-11-12 13:21:58,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-12 13:21:58,862 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:58,862 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:58,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-12 13:21:59,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2024-11-12 13:21:59,063 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:59,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:59,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1739624693, now seen corresponding path program 1 times [2024-11-12 13:21:59,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:59,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338101306] [2024-11-12 13:21:59,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:59,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:59,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:59,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:21:59,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:59,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-12 13:21:59,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:21:59,371 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 13:21:59,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:21:59,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338101306] [2024-11-12 13:21:59,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338101306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:21:59,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:21:59,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-12 13:21:59,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654572258] [2024-11-12 13:21:59,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:21:59,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 13:21:59,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:21:59,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 13:21:59,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-11-12 13:21:59,372 INFO L87 Difference]: Start difference. First operand 1161 states and 1586 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 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-12 13:21:59,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:21:59,683 INFO L93 Difference]: Finished difference Result 1445 states and 1944 transitions. [2024-11-12 13:21:59,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 13:21:59,684 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 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) Word has length 58 [2024-11-12 13:21:59,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:21:59,685 INFO L225 Difference]: With dead ends: 1445 [2024-11-12 13:21:59,685 INFO L226 Difference]: Without dead ends: 1445 [2024-11-12 13:21:59,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2024-11-12 13:21:59,686 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 159 mSDsluCounter, 1381 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 1539 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:21:59,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 1539 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:21:59,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2024-11-12 13:21:59,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1246. [2024-11-12 13:21:59,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1246 states, 1107 states have (on average 1.4037940379403795) internal successors, (1554), 1189 states have internal predecessors, (1554), 50 states have call successors, (50), 25 states have call predecessors, (50), 50 states have return successors, (100), 31 states have call predecessors, (100), 50 states have call successors, (100) [2024-11-12 13:21:59,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1246 states to 1246 states and 1704 transitions. [2024-11-12 13:21:59,696 INFO L78 Accepts]: Start accepts. Automaton has 1246 states and 1704 transitions. Word has length 58 [2024-11-12 13:21:59,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:21:59,697 INFO L471 AbstractCegarLoop]: Abstraction has 1246 states and 1704 transitions. [2024-11-12 13:21:59,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 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-12 13:21:59,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1246 states and 1704 transitions. [2024-11-12 13:21:59,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-12 13:21:59,697 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:21:59,698 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:21:59,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-11-12 13:21:59,698 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:21:59,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:21:59,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1949478456, now seen corresponding path program 1 times [2024-11-12 13:21:59,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:21:59,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379749284] [2024-11-12 13:21:59,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:21:59,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:21:59,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:00,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:22:00,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:00,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 13:22:00,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:00,257 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 13:22:00,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:22:00,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379749284] [2024-11-12 13:22:00,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379749284] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:22:00,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379528161] [2024-11-12 13:22:00,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:22:00,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:22:00,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:22:00,262 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-12 13:22:00,263 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-12 13:22:00,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:00,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-12 13:22:00,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:22:00,566 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-12 13:22:00,601 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-12 13:22:00,706 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-11-12 13:22:00,707 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 23 treesize of output 24 [2024-11-12 13:22:00,759 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:22:00,759 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 30 treesize of output 12 [2024-11-12 13:22:00,760 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:22:00,761 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:22:00,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379528161] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:22:00,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:22:00,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9] total 24 [2024-11-12 13:22:00,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933257623] [2024-11-12 13:22:00,864 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:22:00,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-12 13:22:00,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:22:00,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-12 13:22:00,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=659, Unknown=0, NotChecked=0, Total=756 [2024-11-12 13:22:00,865 INFO L87 Difference]: Start difference. First operand 1246 states and 1704 transitions. Second operand has 25 states, 24 states have (on average 4.333333333333333) internal successors, (104), 22 states have internal predecessors, (104), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:22:01,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:22:01,954 INFO L93 Difference]: Finished difference Result 1697 states and 2263 transitions. [2024-11-12 13:22:01,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-12 13:22:01,954 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.333333333333333) internal successors, (104), 22 states have internal predecessors, (104), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 58 [2024-11-12 13:22:01,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:22:01,957 INFO L225 Difference]: With dead ends: 1697 [2024-11-12 13:22:01,957 INFO L226 Difference]: Without dead ends: 1697 [2024-11-12 13:22:01,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=366, Invalid=2084, Unknown=0, NotChecked=0, Total=2450 [2024-11-12 13:22:01,957 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 1012 mSDsluCounter, 2336 mSDsCounter, 0 mSdLazyCounter, 1626 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1012 SdHoareTripleChecker+Valid, 2502 SdHoareTripleChecker+Invalid, 1667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 13:22:01,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1012 Valid, 2502 Invalid, 1667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1626 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 13:22:01,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2024-11-12 13:22:01,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1266. [2024-11-12 13:22:01,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1127 states have (on average 1.4028393966282164) internal successors, (1581), 1207 states have internal predecessors, (1581), 50 states have call successors, (50), 25 states have call predecessors, (50), 50 states have return successors, (100), 33 states have call predecessors, (100), 50 states have call successors, (100) [2024-11-12 13:22:01,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1731 transitions. [2024-11-12 13:22:01,969 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1731 transitions. Word has length 58 [2024-11-12 13:22:01,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:22:01,969 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 1731 transitions. [2024-11-12 13:22:01,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.333333333333333) internal successors, (104), 22 states have internal predecessors, (104), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:22:01,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1731 transitions. [2024-11-12 13:22:01,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-12 13:22:01,970 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:22:01,970 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:22:01,983 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-12 13:22:02,173 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,SelfDestructingSolverStorable61 [2024-11-12 13:22:02,173 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:22:02,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:22:02,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1949478457, now seen corresponding path program 1 times [2024-11-12 13:22:02,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:22:02,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050286573] [2024-11-12 13:22:02,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:22:02,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:22:02,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:02,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:22:02,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:03,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 13:22:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:03,008 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 13:22:03,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:22:03,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050286573] [2024-11-12 13:22:03,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050286573] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:22:03,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347925365] [2024-11-12 13:22:03,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:22:03,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:22:03,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:22:03,010 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-12 13:22:03,011 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-12 13:22:03,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:03,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-11-12 13:22:03,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:22:03,205 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-12 13:22:03,480 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-12 13:22:03,488 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-12 13:22:03,546 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 11 [2024-11-12 13:22:03,549 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 36 treesize of output 27 [2024-11-12 13:22:03,656 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2024-11-12 13:22:03,656 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 20 treesize of output 20 [2024-11-12 13:22:03,660 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 23 treesize of output 18 [2024-11-12 13:22:03,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 12 [2024-11-12 13:22:03,861 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:22:03,861 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:22:04,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347925365] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:22:04,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:22:04,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12] total 32 [2024-11-12 13:22:04,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538413590] [2024-11-12 13:22:04,068 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:22:04,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-12 13:22:04,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:22:04,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-12 13:22:04,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1278, Unknown=0, NotChecked=0, Total=1406 [2024-11-12 13:22:04,069 INFO L87 Difference]: Start difference. First operand 1266 states and 1731 transitions. Second operand has 33 states, 32 states have (on average 3.28125) internal successors, (105), 31 states have internal predecessors, (105), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:22:07,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:22:07,552 INFO L93 Difference]: Finished difference Result 2017 states and 2665 transitions. [2024-11-12 13:22:07,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-11-12 13:22:07,553 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.28125) internal successors, (105), 31 states have internal predecessors, (105), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 58 [2024-11-12 13:22:07,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:22:07,556 INFO L225 Difference]: With dead ends: 2017 [2024-11-12 13:22:07,556 INFO L226 Difference]: Without dead ends: 2017 [2024-11-12 13:22:07,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1600 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=828, Invalid=5978, Unknown=0, NotChecked=0, Total=6806 [2024-11-12 13:22:07,557 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 1004 mSDsluCounter, 3088 mSDsCounter, 0 mSdLazyCounter, 2965 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1004 SdHoareTripleChecker+Valid, 3236 SdHoareTripleChecker+Invalid, 3008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-12 13:22:07,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1004 Valid, 3236 Invalid, 3008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2965 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-12 13:22:07,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2017 states. [2024-11-12 13:22:07,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2017 to 1342. [2024-11-12 13:22:07,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1342 states, 1195 states have (on average 1.397489539748954) internal successors, (1670), 1277 states have internal predecessors, (1670), 54 states have call successors, (54), 27 states have call predecessors, (54), 54 states have return successors, (108), 37 states have call predecessors, (108), 54 states have call successors, (108) [2024-11-12 13:22:07,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1832 transitions. [2024-11-12 13:22:07,583 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1832 transitions. Word has length 58 [2024-11-12 13:22:07,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:22:07,584 INFO L471 AbstractCegarLoop]: Abstraction has 1342 states and 1832 transitions. [2024-11-12 13:22:07,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.28125) internal successors, (105), 31 states have internal predecessors, (105), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:22:07,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1832 transitions. [2024-11-12 13:22:07,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-12 13:22:07,584 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:22:07,584 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:22:07,599 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-12 13:22:07,785 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,SelfDestructingSolverStorable62 [2024-11-12 13:22:07,785 INFO L396 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:22:07,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:22:07,786 INFO L85 PathProgramCache]: Analyzing trace with hash 193064434, now seen corresponding path program 1 times [2024-11-12 13:22:07,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:22:07,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639045091] [2024-11-12 13:22:07,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:22:07,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:22:07,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:08,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:22:08,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:08,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-12 13:22:08,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:08,155 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 13:22:08,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:22:08,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639045091] [2024-11-12 13:22:08,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639045091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:22:08,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:22:08,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-12 13:22:08,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345998143] [2024-11-12 13:22:08,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:22:08,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-12 13:22:08,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:22:08,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-12 13:22:08,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-12 13:22:08,156 INFO L87 Difference]: Start difference. First operand 1342 states and 1832 transitions. Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 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-12 13:22:08,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:22:08,702 INFO L93 Difference]: Finished difference Result 1537 states and 2058 transitions. [2024-11-12 13:22:08,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-12 13:22:08,703 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 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) Word has length 58 [2024-11-12 13:22:08,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:22:08,709 INFO L225 Difference]: With dead ends: 1537 [2024-11-12 13:22:08,713 INFO L226 Difference]: Without dead ends: 1535 [2024-11-12 13:22:08,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2024-11-12 13:22:08,714 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 310 mSDsluCounter, 1744 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 1898 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:22:08,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 1898 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 13:22:08,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1535 states. [2024-11-12 13:22:08,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1535 to 1293. [2024-11-12 13:22:08,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1293 states, 1150 states have (on average 1.3852173913043477) internal successors, (1593), 1230 states have internal predecessors, (1593), 52 states have call successors, (52), 26 states have call predecessors, (52), 52 states have return successors, (104), 36 states have call predecessors, (104), 52 states have call successors, (104) [2024-11-12 13:22:08,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 1293 states and 1749 transitions. [2024-11-12 13:22:08,734 INFO L78 Accepts]: Start accepts. Automaton has 1293 states and 1749 transitions. Word has length 58 [2024-11-12 13:22:08,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:22:08,735 INFO L471 AbstractCegarLoop]: Abstraction has 1293 states and 1749 transitions. [2024-11-12 13:22:08,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 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-12 13:22:08,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1749 transitions. [2024-11-12 13:22:08,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-12 13:22:08,735 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:22:08,736 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:22:08,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-11-12 13:22:08,736 INFO L396 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:22:08,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:22:08,736 INFO L85 PathProgramCache]: Analyzing trace with hash -412799712, now seen corresponding path program 1 times [2024-11-12 13:22:08,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:22:08,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334541562] [2024-11-12 13:22:08,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:22:08,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:22:08,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:09,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:22:09,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:09,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 13:22:09,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:09,176 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 13:22:09,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:22:09,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334541562] [2024-11-12 13:22:09,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334541562] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:22:09,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707568621] [2024-11-12 13:22:09,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:22:09,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:22:09,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:22:09,178 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-12 13:22:09,179 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-12 13:22:09,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:09,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 101 conjuncts are in the unsatisfiable core [2024-11-12 13:22:09,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:22:09,407 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-12 13:22:09,418 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-12 13:22:09,689 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-12 13:22:09,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:22:09,805 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 40 treesize of output 27 [2024-11-12 13:22:09,816 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-12 13:22:09,993 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2024-11-12 13:22:09,994 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-12 13:22:09,998 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-12 13:22:10,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 12 [2024-11-12 13:22:10,097 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:22:10,097 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:22:10,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707568621] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:22:10,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:22:10,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 29 [2024-11-12 13:22:10,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19019719] [2024-11-12 13:22:10,272 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:22:10,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-12 13:22:10,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:22:10,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-12 13:22:10,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1079, Unknown=0, NotChecked=0, Total=1190 [2024-11-12 13:22:10,274 INFO L87 Difference]: Start difference. First operand 1293 states and 1749 transitions. Second operand has 30 states, 29 states have (on average 3.689655172413793) internal successors, (107), 27 states have internal predecessors, (107), 4 states have call successors, (4), 3 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-12 13:22:13,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:22:13,196 INFO L93 Difference]: Finished difference Result 1795 states and 2348 transitions. [2024-11-12 13:22:13,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-12 13:22:13,196 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.689655172413793) internal successors, (107), 27 states have internal predecessors, (107), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 58 [2024-11-12 13:22:13,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:22:13,199 INFO L225 Difference]: With dead ends: 1795 [2024-11-12 13:22:13,199 INFO L226 Difference]: Without dead ends: 1795 [2024-11-12 13:22:13,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1091 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=555, Invalid=4557, Unknown=0, NotChecked=0, Total=5112 [2024-11-12 13:22:13,200 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 766 mSDsluCounter, 4163 mSDsCounter, 0 mSdLazyCounter, 3947 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 4409 SdHoareTripleChecker+Invalid, 3972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 3947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-12 13:22:13,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [766 Valid, 4409 Invalid, 3972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 3947 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-12 13:22:13,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1795 states. [2024-11-12 13:22:13,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1795 to 1177. [2024-11-12 13:22:13,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 1050 states have (on average 1.3961904761904762) internal successors, (1466), 1123 states have internal predecessors, (1466), 44 states have call successors, (44), 22 states have call predecessors, (44), 44 states have return successors, (88), 31 states have call predecessors, (88), 44 states have call successors, (88) [2024-11-12 13:22:13,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1598 transitions. [2024-11-12 13:22:13,211 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1598 transitions. Word has length 58 [2024-11-12 13:22:13,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:22:13,212 INFO L471 AbstractCegarLoop]: Abstraction has 1177 states and 1598 transitions. [2024-11-12 13:22:13,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.689655172413793) internal successors, (107), 27 states have internal predecessors, (107), 4 states have call successors, (4), 3 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-12 13:22:13,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1598 transitions. [2024-11-12 13:22:13,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-12 13:22:13,212 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:22:13,212 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:22:13,229 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-12 13:22:13,413 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,SelfDestructingSolverStorable64 [2024-11-12 13:22:13,413 INFO L396 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:22:13,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:22:13,413 INFO L85 PathProgramCache]: Analyzing trace with hash -411669398, now seen corresponding path program 1 times [2024-11-12 13:22:13,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:22:13,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000937663] [2024-11-12 13:22:13,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:22:13,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:22:13,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:13,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:22:13,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:13,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 13:22:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:13,760 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 13:22:13,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:22:13,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000937663] [2024-11-12 13:22:13,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000937663] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:22:13,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346769447] [2024-11-12 13:22:13,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:22:13,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:22:13,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:22:13,762 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-12 13:22:13,763 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-12 13:22:13,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:13,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-12 13:22:13,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:22:14,150 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-12 13:22:14,303 INFO L349 Elim1Store]: treesize reduction 38, result has 36.7 percent of original size [2024-11-12 13:22:14,303 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-12 13:22:14,394 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:22:14,395 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2024-11-12 13:22:14,397 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:22:14,397 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:22:14,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346769447] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:22:14,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:22:14,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2024-11-12 13:22:14,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327027] [2024-11-12 13:22:14,461 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:22:14,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-12 13:22:14,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:22:14,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-12 13:22:14,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2024-11-12 13:22:14,462 INFO L87 Difference]: Start difference. First operand 1177 states and 1598 transitions. Second operand has 19 states, 18 states have (on average 6.0) internal successors, (108), 17 states have internal predecessors, (108), 4 states have call successors, (4), 3 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-12 13:22:15,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:22:15,304 INFO L93 Difference]: Finished difference Result 1652 states and 2188 transitions. [2024-11-12 13:22:15,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-12 13:22:15,304 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 6.0) internal successors, (108), 17 states have internal predecessors, (108), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 59 [2024-11-12 13:22:15,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:22:15,307 INFO L225 Difference]: With dead ends: 1652 [2024-11-12 13:22:15,307 INFO L226 Difference]: Without dead ends: 1652 [2024-11-12 13:22:15,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=195, Invalid=995, Unknown=0, NotChecked=0, Total=1190 [2024-11-12 13:22:15,308 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 405 mSDsluCounter, 1732 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 1908 SdHoareTripleChecker+Invalid, 1208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 13:22:15,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 1908 Invalid, 1208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1201 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 13:22:15,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1652 states. [2024-11-12 13:22:15,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1652 to 1249. [2024-11-12 13:22:15,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 1114 states have (on average 1.3895870736086176) internal successors, (1548), 1189 states have internal predecessors, (1548), 48 states have call successors, (48), 24 states have call predecessors, (48), 48 states have return successors, (96), 35 states have call predecessors, (96), 48 states have call successors, (96) [2024-11-12 13:22:15,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1692 transitions. [2024-11-12 13:22:15,318 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1692 transitions. Word has length 59 [2024-11-12 13:22:15,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:22:15,319 INFO L471 AbstractCegarLoop]: Abstraction has 1249 states and 1692 transitions. [2024-11-12 13:22:15,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 6.0) internal successors, (108), 17 states have internal predecessors, (108), 4 states have call successors, (4), 3 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-12 13:22:15,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1692 transitions. [2024-11-12 13:22:15,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-12 13:22:15,319 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:22:15,319 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:22:15,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-12 13:22:15,520 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,SelfDestructingSolverStorable65 [2024-11-12 13:22:15,520 INFO L396 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:22:15,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:22:15,521 INFO L85 PathProgramCache]: Analyzing trace with hash -411669397, now seen corresponding path program 1 times [2024-11-12 13:22:15,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:22:15,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808727128] [2024-11-12 13:22:15,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:22:15,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:22:15,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:16,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:22:16,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:16,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 13:22:16,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:16,082 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 13:22:16,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:22:16,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808727128] [2024-11-12 13:22:16,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808727128] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:22:16,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546220746] [2024-11-12 13:22:16,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:22:16,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:22:16,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:22:16,084 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-12 13:22:16,085 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-12 13:22:16,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:16,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 117 conjuncts are in the unsatisfiable core [2024-11-12 13:22:16,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:22:16,415 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-12 13:22:16,426 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:22:16,426 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-12 13:22:16,703 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 16 treesize of output 11 [2024-11-12 13:22:16,715 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 16 treesize of output 11 [2024-11-12 13:22:16,749 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 16 treesize of output 11 [2024-11-12 13:22:16,762 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 16 treesize of output 11 [2024-11-12 13:22:16,807 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 16 treesize of output 11 [2024-11-12 13:22:16,812 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 16 treesize of output 11 [2024-11-12 13:22:16,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:22:16,903 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 19 treesize of output 18 [2024-11-12 13:22:16,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:22:16,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-12 13:22:17,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:22:17,197 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 19 treesize of output 18 [2024-11-12 13:22:17,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:22:17,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:22:17,214 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-12 13:22:17,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 37 [2024-11-12 13:22:17,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:22:17,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:22:17,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:22:17,390 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2024-11-12 13:22:17,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 55 [2024-11-12 13:22:17,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:22:17,403 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-12 13:22:17,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2024-11-12 13:22:18,123 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:22:18,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 154 treesize of output 182 [2024-11-12 13:22:18,152 INFO L349 Elim1Store]: treesize reduction 62, result has 38.6 percent of original size [2024-11-12 13:22:18,152 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 143 treesize of output 159 [2024-11-12 13:22:19,724 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:22:19,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 131 treesize of output 143 [2024-11-12 13:22:19,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 53 [2024-11-12 13:22:20,042 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:22:20,042 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:22:20,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546220746] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:22:20,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:22:20,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 35 [2024-11-12 13:22:20,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718113177] [2024-11-12 13:22:20,455 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:22:20,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-12 13:22:20,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:22:20,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-12 13:22:20,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1713, Unknown=0, NotChecked=0, Total=1892 [2024-11-12 13:22:20,456 INFO L87 Difference]: Start difference. First operand 1249 states and 1692 transitions. Second operand has 36 states, 35 states have (on average 3.1142857142857143) internal successors, (109), 33 states have internal predecessors, (109), 4 states have call successors, (4), 3 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-12 13:22:24,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:22:24,254 INFO L93 Difference]: Finished difference Result 1581 states and 2083 transitions. [2024-11-12 13:22:24,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-12 13:22:24,255 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.1142857142857143) internal successors, (109), 33 states have internal predecessors, (109), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 59 [2024-11-12 13:22:24,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:22:24,257 INFO L225 Difference]: With dead ends: 1581 [2024-11-12 13:22:24,258 INFO L226 Difference]: Without dead ends: 1581 [2024-11-12 13:22:24,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1135 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=513, Invalid=4179, Unknown=0, NotChecked=0, Total=4692 [2024-11-12 13:22:24,258 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 611 mSDsluCounter, 2809 mSDsCounter, 0 mSdLazyCounter, 2603 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 2961 SdHoareTripleChecker+Invalid, 2631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-12 13:22:24,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [614 Valid, 2961 Invalid, 2631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2603 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-12 13:22:24,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1581 states. [2024-11-12 13:22:24,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1581 to 1271. [2024-11-12 13:22:24,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1271 states, 1136 states have (on average 1.386443661971831) internal successors, (1575), 1209 states have internal predecessors, (1575), 48 states have call successors, (48), 24 states have call predecessors, (48), 48 states have return successors, (96), 37 states have call predecessors, (96), 48 states have call successors, (96) [2024-11-12 13:22:24,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 1719 transitions. [2024-11-12 13:22:24,269 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 1719 transitions. Word has length 59 [2024-11-12 13:22:24,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:22:24,270 INFO L471 AbstractCegarLoop]: Abstraction has 1271 states and 1719 transitions. [2024-11-12 13:22:24,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.1142857142857143) internal successors, (109), 33 states have internal predecessors, (109), 4 states have call successors, (4), 3 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-12 13:22:24,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 1719 transitions. [2024-11-12 13:22:24,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-12 13:22:24,270 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:22:24,271 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2024-11-12 13:22:24,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-12 13:22:24,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:22:24,474 INFO L396 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:22:24,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:22:24,475 INFO L85 PathProgramCache]: Analyzing trace with hash -627848605, now seen corresponding path program 1 times [2024-11-12 13:22:24,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:22:24,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085427309] [2024-11-12 13:22:24,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:22:24,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:22:24,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:25,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:22:25,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:25,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 13:22:25,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:25,751 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 13:22:25,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:22:25,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085427309] [2024-11-12 13:22:25,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085427309] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:22:25,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976125939] [2024-11-12 13:22:25,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:22:25,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:22:25,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:22:25,753 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-12 13:22:25,755 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-12 13:22:25,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:25,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 80 conjuncts are in the unsatisfiable core [2024-11-12 13:22:25,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:22:26,213 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-12 13:22:26,369 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 25 treesize of output 20 [2024-11-12 13:22:26,575 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-11-12 13:22:26,576 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 23 treesize of output 24 [2024-11-12 13:22:26,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-12 13:22:26,654 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:22:26,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:22:26,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976125939] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:22:26,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:22:26,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 14] total 35 [2024-11-12 13:22:26,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979486710] [2024-11-12 13:22:26,765 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:22:26,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-12 13:22:26,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:22:26,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-12 13:22:26,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1269, Unknown=0, NotChecked=0, Total=1406 [2024-11-12 13:22:26,766 INFO L87 Difference]: Start difference. First operand 1271 states and 1719 transitions. Second operand has 36 states, 35 states have (on average 3.0285714285714285) internal successors, (106), 32 states have internal predecessors, (106), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:22:29,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:22:29,152 INFO L93 Difference]: Finished difference Result 1910 states and 2509 transitions. [2024-11-12 13:22:29,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-12 13:22:29,152 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.0285714285714285) internal successors, (106), 32 states have internal predecessors, (106), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 59 [2024-11-12 13:22:29,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:22:29,155 INFO L225 Difference]: With dead ends: 1910 [2024-11-12 13:22:29,155 INFO L226 Difference]: Without dead ends: 1910 [2024-11-12 13:22:29,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 997 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=557, Invalid=3999, Unknown=0, NotChecked=0, Total=4556 [2024-11-12 13:22:29,156 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 858 mSDsluCounter, 4112 mSDsCounter, 0 mSdLazyCounter, 3011 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 4378 SdHoareTripleChecker+Invalid, 3074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-12 13:22:29,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [858 Valid, 4378 Invalid, 3074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3011 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-12 13:22:29,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1910 states. [2024-11-12 13:22:29,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1910 to 1271. [2024-11-12 13:22:29,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1271 states, 1136 states have (on average 1.386443661971831) internal successors, (1575), 1209 states have internal predecessors, (1575), 48 states have call successors, (48), 24 states have call predecessors, (48), 48 states have return successors, (96), 37 states have call predecessors, (96), 48 states have call successors, (96) [2024-11-12 13:22:29,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 1719 transitions. [2024-11-12 13:22:29,198 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 1719 transitions. Word has length 59 [2024-11-12 13:22:29,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:22:29,198 INFO L471 AbstractCegarLoop]: Abstraction has 1271 states and 1719 transitions. [2024-11-12 13:22:29,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.0285714285714285) internal successors, (106), 32 states have internal predecessors, (106), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:22:29,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 1719 transitions. [2024-11-12 13:22:29,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-12 13:22:29,199 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:22:29,199 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2024-11-12 13:22:29,216 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-12 13:22:29,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:22:29,401 INFO L396 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:22:29,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:22:29,401 INFO L85 PathProgramCache]: Analyzing trace with hash -627848604, now seen corresponding path program 1 times [2024-11-12 13:22:29,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:22:29,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922024162] [2024-11-12 13:22:29,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:22:29,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:22:29,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:30,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:22:30,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:30,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 13:22:30,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:30,088 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 13:22:30,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:22:30,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922024162] [2024-11-12 13:22:30,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922024162] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:22:30,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158276761] [2024-11-12 13:22:30,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:22:30,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:22:30,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:22:30,093 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-12 13:22:30,101 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-12 13:22:30,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:30,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 95 conjuncts are in the unsatisfiable core [2024-11-12 13:22:30,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:22:30,377 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-12 13:22:30,380 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-12 13:22:30,745 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-12 13:22:30,749 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 15 treesize of output 1 [2024-11-12 13:22:30,827 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 34 treesize of output 18 [2024-11-12 13:22:30,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-12 13:22:30,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:22:30,998 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 18 treesize of output 13 [2024-11-12 13:22:31,005 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-12 13:22:31,006 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 15 treesize of output 15 [2024-11-12 13:22:31,097 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 17 treesize of output 9 [2024-11-12 13:22:31,100 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:22:31,100 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:22:31,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158276761] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:22:31,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:22:31,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 27 [2024-11-12 13:22:31,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464693985] [2024-11-12 13:22:31,273 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:22:31,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-12 13:22:31,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:22:31,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-12 13:22:31,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=919, Unknown=0, NotChecked=0, Total=1056 [2024-11-12 13:22:31,274 INFO L87 Difference]: Start difference. First operand 1271 states and 1719 transitions. Second operand has 28 states, 27 states have (on average 3.925925925925926) internal successors, (106), 24 states have internal predecessors, (106), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:22:32,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:22:32,251 INFO L93 Difference]: Finished difference Result 1532 states and 2035 transitions. [2024-11-12 13:22:32,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-12 13:22:32,252 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.925925925925926) internal successors, (106), 24 states have internal predecessors, (106), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 59 [2024-11-12 13:22:32,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:22:32,253 INFO L225 Difference]: With dead ends: 1532 [2024-11-12 13:22:32,253 INFO L226 Difference]: Without dead ends: 1532 [2024-11-12 13:22:32,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=227, Invalid=1179, Unknown=0, NotChecked=0, Total=1406 [2024-11-12 13:22:32,254 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 448 mSDsluCounter, 2021 mSDsCounter, 0 mSdLazyCounter, 1739 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 2279 SdHoareTripleChecker+Invalid, 1750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 13:22:32,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 2279 Invalid, 1750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1739 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 13:22:32,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2024-11-12 13:22:32,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1221. [2024-11-12 13:22:32,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1221 states, 1094 states have (on average 1.3912248628884827) internal successors, (1522), 1163 states have internal predecessors, (1522), 44 states have call successors, (44), 22 states have call predecessors, (44), 44 states have return successors, (88), 35 states have call predecessors, (88), 44 states have call successors, (88) [2024-11-12 13:22:32,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 1654 transitions. [2024-11-12 13:22:32,264 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 1654 transitions. Word has length 59 [2024-11-12 13:22:32,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:22:32,264 INFO L471 AbstractCegarLoop]: Abstraction has 1221 states and 1654 transitions. [2024-11-12 13:22:32,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.925925925925926) internal successors, (106), 24 states have internal predecessors, (106), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:22:32,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1654 transitions. [2024-11-12 13:22:32,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-12 13:22:32,265 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:22:32,265 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:22:32,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-12 13:22:32,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68 [2024-11-12 13:22:32,469 INFO L396 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-12 13:22:32,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:22:32,470 INFO L85 PathProgramCache]: Analyzing trace with hash -990115430, now seen corresponding path program 1 times [2024-11-12 13:22:32,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:22:32,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638970236] [2024-11-12 13:22:32,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:22:32,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:22:32,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:33,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-12 13:22:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:33,925 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-12 13:22:33,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:22:33,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638970236] [2024-11-12 13:22:33,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638970236] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:22:33,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32548466] [2024-11-12 13:22:33,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:22:33,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:22:33,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:22:33,927 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:22:33,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-12 13:22:34,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:34,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 84 conjuncts are in the unsatisfiable core [2024-11-12 13:22:34,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:22:34,186 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:22:34,186 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-12 13:22:34,391 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-12 13:22:34,399 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-12 13:22:34,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:22:34,513 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 27 treesize of output 11 [2024-11-12 13:22:34,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:22:34,519 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 27 treesize of output 11 [2024-11-12 13:22:34,590 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 23 treesize of output 11 [2024-11-12 13:22:34,598 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 23 treesize of output 11 [2024-11-12 13:22:34,705 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 16 treesize of output 11 [2024-11-12 13:22:34,710 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 16 treesize of output 11 [2024-11-12 13:22:34,871 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 16 treesize of output 11 [2024-11-12 13:22:34,875 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 19 treesize of output 18 [2024-11-12 13:22:34,965 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:22:34,971 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-12 13:22:34,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 41 [2024-11-12 13:22:34,976 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 22 treesize of output 17 [2024-11-12 13:22:35,411 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:22:35,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:22:35,414 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:22:35,425 INFO L349 Elim1Store]: treesize reduction 34, result has 27.7 percent of original size [2024-11-12 13:22:35,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 66 treesize of output 44 [2024-11-12 13:22:35,430 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:22:35,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2024-11-12 13:22:35,456 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-12 13:22:35,456 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:22:35,661 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_append_one_~list#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_append_one_~list#1.base|) (+ |c_ULTIMATE.start_append_one_~list#1.offset| 4) |c_ULTIMATE.start_append_one_~item~1#1.base|)))) (let ((.cse1 (select (select .cse0 |c_~#list~0.base|) |c_~#list~0.offset|))) (and (= (select (select .cse0 .cse1) 4) 0) (forall ((v_ArrVal_2137 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_append_one_~list#1.base| v_ArrVal_2137) .cse1) 4) 0))))) is different from false