./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-broom/dll-lst-shared.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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-broom/dll-lst-shared.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash 6f8708414d69d58e69308ef3f6436b82a3a2ac306b0f68b7007fd3139e12ef15 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 13:31:41,782 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 13:31:41,851 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-12 13:31:41,855 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 13:31:41,858 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 13:31:41,884 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 13:31:41,885 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 13:31:41,885 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 13:31:41,886 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 13:31:41,887 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 13:31:41,888 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 13:31:41,888 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 13:31:41,888 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 13:31:41,890 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 13:31:41,890 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 13:31:41,890 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 13:31:41,891 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 13:31:41,891 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 13:31:41,891 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 13:31:41,891 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 13:31:41,891 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 13:31:41,893 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 13:31:41,893 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 13:31:41,893 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 13:31:41,894 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 13:31:41,894 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 13:31:41,894 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 13:31:41,894 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 13:31:41,894 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 13:31:41,894 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 13:31:41,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:31:41,895 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 13:31:41,895 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 13:31:41,895 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 13:31:41,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 13:31:41,895 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 13:31:41,895 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 13:31:41,895 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 13:31:41,896 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 13:31:41,896 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6f8708414d69d58e69308ef3f6436b82a3a2ac306b0f68b7007fd3139e12ef15 [2024-11-12 13:31:42,123 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 13:31:42,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 13:31:42,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 13:31:42,149 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 13:31:42,150 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 13:31:42,151 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/dll-lst-shared.i [2024-11-12 13:31:43,470 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 13:31:43,707 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 13:31:43,708 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/dll-lst-shared.i [2024-11-12 13:31:43,730 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39e2f7f61/fe0757f88bca414cac5b26e1f9fe0313/FLAG1937fb4d5 [2024-11-12 13:31:43,741 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39e2f7f61/fe0757f88bca414cac5b26e1f9fe0313 [2024-11-12 13:31:43,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 13:31:43,745 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 13:31:43,746 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 13:31:43,747 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 13:31:43,753 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 13:31:43,754 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:31:43" (1/1) ... [2024-11-12 13:31:43,756 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12342cb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:31:43, skipping insertion in model container [2024-11-12 13:31:43,756 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:31:43" (1/1) ... [2024-11-12 13:31:43,803 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 13:31:44,108 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:31:44,118 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 13:31:44,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:31:44,178 INFO L204 MainTranslator]: Completed translation [2024-11-12 13:31:44,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:31:44 WrapperNode [2024-11-12 13:31:44,178 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 13:31:44,179 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 13:31:44,179 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 13:31:44,179 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 13:31:44,185 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:31:44" (1/1) ... [2024-11-12 13:31:44,199 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:31:44" (1/1) ... [2024-11-12 13:31:44,217 INFO L138 Inliner]: procedures = 121, calls = 26, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 78 [2024-11-12 13:31:44,218 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 13:31:44,218 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 13:31:44,218 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 13:31:44,218 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 13:31:44,227 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:31:44" (1/1) ... [2024-11-12 13:31:44,228 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:31:44" (1/1) ... [2024-11-12 13:31:44,230 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:31:44" (1/1) ... [2024-11-12 13:31:44,243 INFO L175 MemorySlicer]: Split 14 memory accesses to 1 slices as follows [14]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 7 writes are split as follows [7]. [2024-11-12 13:31:44,243 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:31:44" (1/1) ... [2024-11-12 13:31:44,243 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:31:44" (1/1) ... [2024-11-12 13:31:44,253 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:31:44" (1/1) ... [2024-11-12 13:31:44,256 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:31:44" (1/1) ... [2024-11-12 13:31:44,258 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:31:44" (1/1) ... [2024-11-12 13:31:44,259 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:31:44" (1/1) ... [2024-11-12 13:31:44,261 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 13:31:44,266 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 13:31:44,266 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 13:31:44,266 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 13:31:44,267 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:31:44" (1/1) ... [2024-11-12 13:31:44,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:31:44,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:31:44,297 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:31:44,301 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:31:44,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 13:31:44,343 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2024-11-12 13:31:44,343 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2024-11-12 13:31:44,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 13:31:44,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 13:31:44,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 13:31:44,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 13:31:44,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 13:31:44,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 13:31:44,438 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 13:31:44,440 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 13:31:44,747 INFO L? ?]: Removed 88 outVars from TransFormulas that were not future-live. [2024-11-12 13:31:44,748 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 13:31:44,760 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 13:31:44,760 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-12 13:31:44,761 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:31:44 BoogieIcfgContainer [2024-11-12 13:31:44,761 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 13:31:44,765 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 13:31:44,765 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 13:31:44,768 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 13:31:44,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:31:43" (1/3) ... [2024-11-12 13:31:44,769 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b7b945a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:31:44, skipping insertion in model container [2024-11-12 13:31:44,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:31:44" (2/3) ... [2024-11-12 13:31:44,770 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b7b945a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:31:44, skipping insertion in model container [2024-11-12 13:31:44,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:31:44" (3/3) ... [2024-11-12 13:31:44,772 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-lst-shared.i [2024-11-12 13:31:44,787 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 13:31:44,788 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 35 error locations. [2024-11-12 13:31:44,831 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 13:31:44,838 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;@19efc55b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 13:31:44,838 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2024-11-12 13:31:44,842 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 46 states have (on average 1.9130434782608696) internal successors, (88), 81 states have internal predecessors, (88), 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:31:44,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-12 13:31:44,847 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:31:44,849 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-12 13:31:44,850 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-12 13:31:44,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:31:44,856 INFO L85 PathProgramCache]: Analyzing trace with hash 37387707, now seen corresponding path program 1 times [2024-11-12 13:31:44,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:31:44,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842586907] [2024-11-12 13:31:44,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:31:44,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:31:44,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:45,045 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:31:45,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:31:45,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842586907] [2024-11-12 13:31:45,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842586907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:31:45,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:31:45,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:31:45,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114126704] [2024-11-12 13:31:45,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:31:45,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:31:45,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:31:45,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:31:45,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:31:45,073 INFO L87 Difference]: Start difference. First operand has 85 states, 46 states have (on average 1.9130434782608696) internal successors, (88), 81 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:31:45,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:31:45,134 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2024-11-12 13:31:45,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:31:45,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-12 13:31:45,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:31:45,142 INFO L225 Difference]: With dead ends: 83 [2024-11-12 13:31:45,142 INFO L226 Difference]: Without dead ends: 81 [2024-11-12 13:31:45,144 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:31:45,146 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 2 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:31:45,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 130 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:31:45,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-12 13:31:45,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-12 13:31:45,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 45 states have (on average 1.8) internal successors, (81), 77 states have internal predecessors, (81), 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:31:45,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2024-11-12 13:31:45,173 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 5 [2024-11-12 13:31:45,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:31:45,174 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2024-11-12 13:31:45,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:31:45,174 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2024-11-12 13:31:45,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-12 13:31:45,174 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:31:45,174 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-12 13:31:45,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 13:31:45,175 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-12 13:31:45,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:31:45,175 INFO L85 PathProgramCache]: Analyzing trace with hash 37387708, now seen corresponding path program 1 times [2024-11-12 13:31:45,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:31:45,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176125092] [2024-11-12 13:31:45,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:31:45,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:31:45,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:45,258 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:31:45,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:31:45,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176125092] [2024-11-12 13:31:45,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176125092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:31:45,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:31:45,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:31:45,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104028104] [2024-11-12 13:31:45,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:31:45,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:31:45,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:31:45,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:31:45,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:31:45,261 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:31:45,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:31:45,301 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2024-11-12 13:31:45,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:31:45,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-12 13:31:45,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:31:45,303 INFO L225 Difference]: With dead ends: 79 [2024-11-12 13:31:45,303 INFO L226 Difference]: Without dead ends: 79 [2024-11-12 13:31:45,303 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:31:45,304 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 2 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:31:45,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 134 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:31:45,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-12 13:31:45,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-12 13:31:45,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 45 states have (on average 1.7555555555555555) internal successors, (79), 75 states have internal predecessors, (79), 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:31:45,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2024-11-12 13:31:45,310 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 5 [2024-11-12 13:31:45,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:31:45,310 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2024-11-12 13:31:45,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:31:45,310 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2024-11-12 13:31:45,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-12 13:31:45,310 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:31:45,311 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:31:45,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 13:31:45,311 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-12 13:31:45,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:31:45,311 INFO L85 PathProgramCache]: Analyzing trace with hash -802469099, now seen corresponding path program 1 times [2024-11-12 13:31:45,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:31:45,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516743157] [2024-11-12 13:31:45,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:31:45,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:31:45,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:45,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:31:45,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:45,464 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:31:45,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:31:45,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516743157] [2024-11-12 13:31:45,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516743157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:31:45,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:31:45,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:31:45,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898862736] [2024-11-12 13:31:45,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:31:45,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:31:45,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:31:45,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:31:45,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:31:45,470 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:31:45,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:31:45,612 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2024-11-12 13:31:45,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:31:45,613 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 11 [2024-11-12 13:31:45,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:31:45,615 INFO L225 Difference]: With dead ends: 83 [2024-11-12 13:31:45,615 INFO L226 Difference]: Without dead ends: 83 [2024-11-12 13:31:45,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:31:45,617 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 9 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:31:45,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 159 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:31:45,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-12 13:31:45,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2024-11-12 13:31:45,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 45 states have (on average 1.7333333333333334) internal successors, (78), 74 states have internal predecessors, (78), 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:31:45,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2024-11-12 13:31:45,628 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 11 [2024-11-12 13:31:45,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:31:45,628 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2024-11-12 13:31:45,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:31:45,628 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2024-11-12 13:31:45,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-12 13:31:45,629 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:31:45,629 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:31:45,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 13:31:45,629 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-12 13:31:45,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:31:45,630 INFO L85 PathProgramCache]: Analyzing trace with hash -802469100, now seen corresponding path program 1 times [2024-11-12 13:31:45,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:31:45,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497176892] [2024-11-12 13:31:45,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:31:45,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:31:45,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:45,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:31:45,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:45,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:31:45,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:31:45,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497176892] [2024-11-12 13:31:45,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497176892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:31:45,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:31:45,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:31:45,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113975853] [2024-11-12 13:31:45,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:31:45,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:31:45,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:31:45,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:31:45,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:31:45,708 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:31:45,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:31:45,790 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2024-11-12 13:31:45,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:31:45,790 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 11 [2024-11-12 13:31:45,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:31:45,791 INFO L225 Difference]: With dead ends: 82 [2024-11-12 13:31:45,792 INFO L226 Difference]: Without dead ends: 82 [2024-11-12 13:31:45,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:31:45,794 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 9 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:31:45,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 153 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:31:45,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-12 13:31:45,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2024-11-12 13:31:45,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 45 states have (on average 1.711111111111111) internal successors, (77), 73 states have internal predecessors, (77), 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:31:45,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2024-11-12 13:31:45,803 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 11 [2024-11-12 13:31:45,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:31:45,803 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2024-11-12 13:31:45,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:31:45,804 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2024-11-12 13:31:45,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-12 13:31:45,804 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:31:45,804 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:31:45,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 13:31:45,804 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-12 13:31:45,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:31:45,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1921307765, now seen corresponding path program 1 times [2024-11-12 13:31:45,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:31:45,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216355617] [2024-11-12 13:31:45,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:31:45,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:31:45,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:45,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:31:45,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:46,029 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:31:46,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:31:46,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216355617] [2024-11-12 13:31:46,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216355617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:31:46,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:31:46,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 13:31:46,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345788371] [2024-11-12 13:31:46,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:31:46,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:31:46,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:31:46,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:31:46,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:31:46,031 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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:31:46,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:31:46,203 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2024-11-12 13:31:46,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:31:46,204 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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 13 [2024-11-12 13:31:46,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:31:46,204 INFO L225 Difference]: With dead ends: 78 [2024-11-12 13:31:46,205 INFO L226 Difference]: Without dead ends: 78 [2024-11-12 13:31:46,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:31:46,206 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 16 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:31:46,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 265 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:31:46,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-12 13:31:46,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2024-11-12 13:31:46,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 45 states have (on average 1.6222222222222222) internal successors, (73), 69 states have internal predecessors, (73), 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:31:46,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2024-11-12 13:31:46,213 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 13 [2024-11-12 13:31:46,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:31:46,214 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2024-11-12 13:31:46,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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:31:46,214 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2024-11-12 13:31:46,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-12 13:31:46,214 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:31:46,214 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:31:46,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 13:31:46,215 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-12 13:31:46,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:31:46,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1921307766, now seen corresponding path program 1 times [2024-11-12 13:31:46,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:31:46,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646279923] [2024-11-12 13:31:46,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:31:46,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:31:46,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:46,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:31:46,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:46,509 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:31:46,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:31:46,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646279923] [2024-11-12 13:31:46,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646279923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:31:46,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:31:46,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 13:31:46,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947684912] [2024-11-12 13:31:46,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:31:46,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 13:31:46,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:31:46,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 13:31:46,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-12 13:31:46,511 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 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:31:46,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:31:46,655 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2024-11-12 13:31:46,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:31:46,655 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 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 13 [2024-11-12 13:31:46,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:31:46,657 INFO L225 Difference]: With dead ends: 77 [2024-11-12 13:31:46,657 INFO L226 Difference]: Without dead ends: 77 [2024-11-12 13:31:46,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-12 13:31:46,658 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 6 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:31:46,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 304 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:31:46,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-12 13:31:46,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2024-11-12 13:31:46,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 45 states have (on average 1.6) internal successors, (72), 68 states have internal predecessors, (72), 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:31:46,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2024-11-12 13:31:46,668 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 13 [2024-11-12 13:31:46,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:31:46,668 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2024-11-12 13:31:46,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 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:31:46,668 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2024-11-12 13:31:46,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-12 13:31:46,668 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:31:46,668 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:31:46,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 13:31:46,669 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-12 13:31:46,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:31:46,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1295463995, now seen corresponding path program 1 times [2024-11-12 13:31:46,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:31:46,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846803273] [2024-11-12 13:31:46,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:31:46,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:31:46,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:46,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:31:46,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:46,767 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:31:46,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:31:46,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846803273] [2024-11-12 13:31:46,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846803273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:31:46,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:31:46,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 13:31:46,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141435460] [2024-11-12 13:31:46,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:31:46,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 13:31:46,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:31:46,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 13:31:46,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:31:46,768 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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:31:46,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:31:46,896 INFO L93 Difference]: Finished difference Result 101 states and 113 transitions. [2024-11-12 13:31:46,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 13:31:46,897 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 19 [2024-11-12 13:31:46,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:31:46,897 INFO L225 Difference]: With dead ends: 101 [2024-11-12 13:31:46,898 INFO L226 Difference]: Without dead ends: 101 [2024-11-12 13:31:46,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:31:46,898 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 42 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:31:46,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 250 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:31:46,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-12 13:31:46,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91. [2024-11-12 13:31:46,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 63 states have (on average 1.6349206349206349) internal successors, (103), 86 states have internal predecessors, (103), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:31:46,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 109 transitions. [2024-11-12 13:31:46,907 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 109 transitions. Word has length 19 [2024-11-12 13:31:46,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:31:46,908 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 109 transitions. [2024-11-12 13:31:46,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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:31:46,908 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 109 transitions. [2024-11-12 13:31:46,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-12 13:31:46,908 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:31:46,909 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:31:46,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 13:31:46,909 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-12 13:31:46,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:31:46,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1295463996, now seen corresponding path program 1 times [2024-11-12 13:31:46,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:31:46,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766983466] [2024-11-12 13:31:46,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:31:46,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:31:46,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:47,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:31:47,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:47,120 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:31:47,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:31:47,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766983466] [2024-11-12 13:31:47,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766983466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:31:47,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:31:47,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 13:31:47,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751412935] [2024-11-12 13:31:47,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:31:47,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 13:31:47,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:31:47,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 13:31:47,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-12 13:31:47,123 INFO L87 Difference]: Start difference. First operand 91 states and 109 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 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:31:47,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:31:47,310 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2024-11-12 13:31:47,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 13:31:47,311 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 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 19 [2024-11-12 13:31:47,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:31:47,312 INFO L225 Difference]: With dead ends: 109 [2024-11-12 13:31:47,312 INFO L226 Difference]: Without dead ends: 109 [2024-11-12 13:31:47,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-12 13:31:47,312 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 42 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:31:47,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 416 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:31:47,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-12 13:31:47,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 97. [2024-11-12 13:31:47,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.6231884057971016) internal successors, (112), 92 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:31:47,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2024-11-12 13:31:47,320 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 19 [2024-11-12 13:31:47,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:31:47,321 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2024-11-12 13:31:47,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 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:31:47,321 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2024-11-12 13:31:47,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-12 13:31:47,324 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:31:47,324 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:31:47,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 13:31:47,325 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-12 13:31:47,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:31:47,325 INFO L85 PathProgramCache]: Analyzing trace with hash -599661973, now seen corresponding path program 1 times [2024-11-12 13:31:47,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:31:47,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747405321] [2024-11-12 13:31:47,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:31:47,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:31:47,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:47,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:31:47,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:47,451 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:31:47,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:31:47,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747405321] [2024-11-12 13:31:47,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747405321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:31:47,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:31:47,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 13:31:47,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438201742] [2024-11-12 13:31:47,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:31:47,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 13:31:47,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:31:47,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 13:31:47,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 13:31:47,458 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) 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:31:47,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:31:47,537 INFO L93 Difference]: Finished difference Result 106 states and 129 transitions. [2024-11-12 13:31:47,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 13:31:47,537 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) 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:31:47,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:31:47,539 INFO L225 Difference]: With dead ends: 106 [2024-11-12 13:31:47,539 INFO L226 Difference]: Without dead ends: 106 [2024-11-12 13:31:47,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 13:31:47,540 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 26 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:31:47,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 450 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:31:47,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-12 13:31:47,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2024-11-12 13:31:47,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 70 states have (on average 1.6) internal successors, (112), 93 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:31:47,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2024-11-12 13:31:47,547 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 21 [2024-11-12 13:31:47,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:31:47,547 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2024-11-12 13:31:47,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) 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:31:47,547 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2024-11-12 13:31:47,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-12 13:31:47,548 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:31:47,548 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:31:47,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 13:31:47,548 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-12 13:31:47,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:31:47,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1408205040, now seen corresponding path program 1 times [2024-11-12 13:31:47,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:31:47,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801814998] [2024-11-12 13:31:47,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:31:47,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:31:47,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:47,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:31:47,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:47,666 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:31:47,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:31:47,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801814998] [2024-11-12 13:31:47,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801814998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:31:47,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:31:47,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 13:31:47,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063481089] [2024-11-12 13:31:47,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:31:47,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 13:31:47,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:31:47,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 13:31:47,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:31:47,669 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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:31:47,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:31:47,818 INFO L93 Difference]: Finished difference Result 111 states and 126 transitions. [2024-11-12 13:31:47,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 13:31:47,818 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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:31:47,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:31:47,819 INFO L225 Difference]: With dead ends: 111 [2024-11-12 13:31:47,819 INFO L226 Difference]: Without dead ends: 111 [2024-11-12 13:31:47,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:31:47,819 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 34 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:31:47,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 248 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:31:47,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-12 13:31:47,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 102. [2024-11-12 13:31:47,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 74 states have (on average 1.5810810810810811) internal successors, (117), 97 states have internal predecessors, (117), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:31:47,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 123 transitions. [2024-11-12 13:31:47,824 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 123 transitions. Word has length 22 [2024-11-12 13:31:47,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:31:47,824 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 123 transitions. [2024-11-12 13:31:47,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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:31:47,824 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 123 transitions. [2024-11-12 13:31:47,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-12 13:31:47,825 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:31:47,825 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:31:47,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 13:31:47,825 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-12 13:31:47,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:31:47,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1408205039, now seen corresponding path program 1 times [2024-11-12 13:31:47,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:31:47,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828370038] [2024-11-12 13:31:47,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:31:47,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:31:47,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:48,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:31:48,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:48,152 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:31:48,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:31:48,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828370038] [2024-11-12 13:31:48,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828370038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:31:48,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:31:48,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 13:31:48,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692976617] [2024-11-12 13:31:48,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:31:48,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 13:31:48,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:31:48,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 13:31:48,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-12 13:31:48,155 INFO L87 Difference]: Start difference. First operand 102 states and 123 transitions. Second operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 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:31:48,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:31:48,310 INFO L93 Difference]: Finished difference Result 109 states and 130 transitions. [2024-11-12 13:31:48,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 13:31:48,311 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 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:31:48,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:31:48,311 INFO L225 Difference]: With dead ends: 109 [2024-11-12 13:31:48,312 INFO L226 Difference]: Without dead ends: 109 [2024-11-12 13:31:48,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-12 13:31:48,312 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 8 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:31:48,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 314 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:31:48,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-12 13:31:48,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-12 13:31:48,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 81 states have (on average 1.5308641975308641) internal successors, (124), 104 states have internal predecessors, (124), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:31:48,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 130 transitions. [2024-11-12 13:31:48,316 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 130 transitions. Word has length 22 [2024-11-12 13:31:48,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:31:48,316 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 130 transitions. [2024-11-12 13:31:48,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 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:31:48,316 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 130 transitions. [2024-11-12 13:31:48,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-12 13:31:48,317 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:31:48,317 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:31:48,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 13:31:48,317 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-12 13:31:48,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:31:48,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1461881377, now seen corresponding path program 1 times [2024-11-12 13:31:48,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:31:48,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117877039] [2024-11-12 13:31:48,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:31:48,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:31:48,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:48,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:31:48,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:48,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 13:31:48,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:48,454 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:31:48,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:31:48,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117877039] [2024-11-12 13:31:48,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117877039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:31:48,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:31:48,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 13:31:48,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733098980] [2024-11-12 13:31:48,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:31:48,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 13:31:48,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:31:48,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 13:31:48,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:31:48,456 INFO L87 Difference]: Start difference. First operand 109 states and 130 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (2), 1 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:31:48,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:31:48,539 INFO L93 Difference]: Finished difference Result 109 states and 129 transitions. [2024-11-12 13:31:48,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:31:48,539 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (2), 1 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 23 [2024-11-12 13:31:48,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:31:48,540 INFO L225 Difference]: With dead ends: 109 [2024-11-12 13:31:48,540 INFO L226 Difference]: Without dead ends: 109 [2024-11-12 13:31:48,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:31:48,541 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 14 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:31:48,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 128 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:31:48,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-12 13:31:48,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-12 13:31:48,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 81 states have (on average 1.5185185185185186) internal successors, (123), 104 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:31:48,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 129 transitions. [2024-11-12 13:31:48,544 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 129 transitions. Word has length 23 [2024-11-12 13:31:48,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:31:48,545 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 129 transitions. [2024-11-12 13:31:48,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (2), 1 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:31:48,545 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 129 transitions. [2024-11-12 13:31:48,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-12 13:31:48,545 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:31:48,545 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:31:48,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 13:31:48,546 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-12 13:31:48,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:31:48,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1461881378, now seen corresponding path program 1 times [2024-11-12 13:31:48,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:31:48,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237279702] [2024-11-12 13:31:48,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:31:48,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:31:48,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:48,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:31:48,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:48,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 13:31:48,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:48,858 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:31:48,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:31:48,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237279702] [2024-11-12 13:31:48,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237279702] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:31:48,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900400363] [2024-11-12 13:31:48,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:31:48,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:31:48,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:31:48,861 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:31:48,862 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:31:48,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:48,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-12 13:31:48,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:31:49,021 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:31:49,034 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:31:49,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:31:49,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:31:49,164 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:31:49,165 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:31:49,267 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2024-11-12 13:31:49,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:31:49,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:31:49,312 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:31:49,312 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:31:49,316 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-12 13:31:49,317 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:31:49,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900400363] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:31:49,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:31:49,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2024-11-12 13:31:49,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31754240] [2024-11-12 13:31:49,471 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:31:49,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-12 13:31:49,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:31:49,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-12 13:31:49,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=321, Unknown=1, NotChecked=36, Total=420 [2024-11-12 13:31:49,473 INFO L87 Difference]: Start difference. First operand 109 states and 129 transitions. Second operand has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 14 states have internal predecessors, (35), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-12 13:31:49,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:31:49,740 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2024-11-12 13:31:49,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 13:31:49,740 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 14 states have internal predecessors, (35), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 23 [2024-11-12 13:31:49,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:31:49,741 INFO L225 Difference]: With dead ends: 113 [2024-11-12 13:31:49,741 INFO L226 Difference]: Without dead ends: 113 [2024-11-12 13:31:49,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=391, Unknown=1, NotChecked=40, Total=506 [2024-11-12 13:31:49,742 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 58 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:31:49,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 352 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 311 Invalid, 0 Unknown, 91 Unchecked, 0.2s Time] [2024-11-12 13:31:49,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-12 13:31:49,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 109. [2024-11-12 13:31:49,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 81 states have (on average 1.4691358024691359) internal successors, (119), 104 states have internal predecessors, (119), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:31:49,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 125 transitions. [2024-11-12 13:31:49,745 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 125 transitions. Word has length 23 [2024-11-12 13:31:49,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:31:49,745 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 125 transitions. [2024-11-12 13:31:49,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 14 states have internal predecessors, (35), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-12 13:31:49,746 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 125 transitions. [2024-11-12 13:31:49,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-12 13:31:49,746 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:31:49,746 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:31:49,762 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:31:49,947 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,SelfDestructingSolverStorable12 [2024-11-12 13:31:49,947 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-12 13:31:49,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:31:49,948 INFO L85 PathProgramCache]: Analyzing trace with hash -60274233, now seen corresponding path program 1 times [2024-11-12 13:31:49,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:31:49,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880209055] [2024-11-12 13:31:49,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:31:49,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:31:49,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:50,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:31:50,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:50,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 13:31:50,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:50,094 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 13:31:50,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:31:50,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880209055] [2024-11-12 13:31:50,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880209055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:31:50,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:31:50,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 13:31:50,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10272670] [2024-11-12 13:31:50,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:31:50,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:31:50,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:31:50,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:31:50,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:31:50,095 INFO L87 Difference]: Start difference. First operand 109 states and 125 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 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:31:50,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:31:50,235 INFO L93 Difference]: Finished difference Result 108 states and 123 transitions. [2024-11-12 13:31:50,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 13:31:50,236 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 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 26 [2024-11-12 13:31:50,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:31:50,237 INFO L225 Difference]: With dead ends: 108 [2024-11-12 13:31:50,237 INFO L226 Difference]: Without dead ends: 108 [2024-11-12 13:31:50,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-12 13:31:50,237 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 8 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:31:50,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 279 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:31:50,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-12 13:31:50,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-12 13:31:50,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 81 states have (on average 1.4444444444444444) internal successors, (117), 103 states have internal predecessors, (117), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:31:50,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 123 transitions. [2024-11-12 13:31:50,240 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 123 transitions. Word has length 26 [2024-11-12 13:31:50,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:31:50,241 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 123 transitions. [2024-11-12 13:31:50,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 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:31:50,241 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 123 transitions. [2024-11-12 13:31:50,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-12 13:31:50,241 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:31:50,241 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:31:50,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 13:31:50,241 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-12 13:31:50,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:31:50,242 INFO L85 PathProgramCache]: Analyzing trace with hash -60274232, now seen corresponding path program 1 times [2024-11-12 13:31:50,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:31:50,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161981187] [2024-11-12 13:31:50,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:31:50,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:31:50,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:50,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:31:50,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:50,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 13:31:50,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:50,493 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:31:50,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:31:50,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161981187] [2024-11-12 13:31:50,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161981187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:31:50,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:31:50,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 13:31:50,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222763934] [2024-11-12 13:31:50,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:31:50,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:31:50,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:31:50,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:31:50,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:31:50,497 INFO L87 Difference]: Start difference. First operand 108 states and 123 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 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:31:50,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:31:50,651 INFO L93 Difference]: Finished difference Result 107 states and 121 transitions. [2024-11-12 13:31:50,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 13:31:50,651 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 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 26 [2024-11-12 13:31:50,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:31:50,652 INFO L225 Difference]: With dead ends: 107 [2024-11-12 13:31:50,652 INFO L226 Difference]: Without dead ends: 107 [2024-11-12 13:31:50,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-12 13:31:50,653 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 3 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:31:50,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 313 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:31:50,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-12 13:31:50,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-12 13:31:50,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 81 states have (on average 1.4197530864197532) internal successors, (115), 102 states have internal predecessors, (115), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:31:50,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 121 transitions. [2024-11-12 13:31:50,657 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 121 transitions. Word has length 26 [2024-11-12 13:31:50,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:31:50,658 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 121 transitions. [2024-11-12 13:31:50,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 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:31:50,658 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2024-11-12 13:31:50,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-12 13:31:50,659 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:31:50,659 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:31:50,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 13:31:50,659 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-12 13:31:50,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:31:50,660 INFO L85 PathProgramCache]: Analyzing trace with hash 862583441, now seen corresponding path program 1 times [2024-11-12 13:31:50,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:31:50,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102044120] [2024-11-12 13:31:50,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:31:50,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:31:50,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:50,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:31:50,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:50,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:31:50,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:31:50,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102044120] [2024-11-12 13:31:50,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102044120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:31:50,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:31:50,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 13:31:50,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446044006] [2024-11-12 13:31:50,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:31:50,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:31:50,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:31:50,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:31:50,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:31:50,749 INFO L87 Difference]: Start difference. First operand 107 states and 121 transitions. Second operand has 8 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:31:50,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:31:50,922 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2024-11-12 13:31:50,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 13:31:50,923 INFO L78 Accepts]: Start accepts. Automaton has has 8 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:31:50,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:31:50,924 INFO L225 Difference]: With dead ends: 116 [2024-11-12 13:31:50,924 INFO L226 Difference]: Without dead ends: 116 [2024-11-12 13:31:50,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-12 13:31:50,925 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 42 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:31:50,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 229 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:31:50,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-12 13:31:50,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 111. [2024-11-12 13:31:50,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 86 states have (on average 1.430232558139535) internal successors, (123), 106 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:31:50,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 129 transitions. [2024-11-12 13:31:50,930 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 129 transitions. Word has length 27 [2024-11-12 13:31:50,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:31:50,930 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 129 transitions. [2024-11-12 13:31:50,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 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:31:50,931 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 129 transitions. [2024-11-12 13:31:50,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-12 13:31:50,931 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:31:50,931 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:31:50,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 13:31:50,932 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-12 13:31:50,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:31:50,932 INFO L85 PathProgramCache]: Analyzing trace with hash 862583442, now seen corresponding path program 1 times [2024-11-12 13:31:50,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:31:50,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560786692] [2024-11-12 13:31:50,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:31:50,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:31:50,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:51,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:31:51,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:51,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:31:51,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:31:51,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560786692] [2024-11-12 13:31:51,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560786692] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:31:51,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145456888] [2024-11-12 13:31:51,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:31:51,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:31:51,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:31:51,106 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:31:51,107 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:31:51,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:51,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-12 13:31:51,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:31:51,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:31:51,321 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:31:51,376 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:31:51,377 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 19 treesize of output 23 [2024-11-12 13:31:51,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:31:51,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145456888] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:31:51,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:31:51,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 20 [2024-11-12 13:31:51,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444603271] [2024-11-12 13:31:51,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:31:51,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-12 13:31:51,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:31:51,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-12 13:31:51,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2024-11-12 13:31:51,524 INFO L87 Difference]: Start difference. First operand 111 states and 129 transitions. Second operand has 21 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 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:31:51,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:31:51,850 INFO L93 Difference]: Finished difference Result 121 states and 136 transitions. [2024-11-12 13:31:51,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 13:31:51,851 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 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 27 [2024-11-12 13:31:51,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:31:51,851 INFO L225 Difference]: With dead ends: 121 [2024-11-12 13:31:51,851 INFO L226 Difference]: Without dead ends: 121 [2024-11-12 13:31:51,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=616, Unknown=0, NotChecked=0, Total=702 [2024-11-12 13:31:51,852 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 130 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:31:51,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 523 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:31:51,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-12 13:31:51,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 114. [2024-11-12 13:31:51,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 90 states have (on average 1.3888888888888888) internal successors, (125), 109 states have internal predecessors, (125), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:31:51,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 131 transitions. [2024-11-12 13:31:51,855 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 131 transitions. Word has length 27 [2024-11-12 13:31:51,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:31:51,855 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 131 transitions. [2024-11-12 13:31:51,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 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:31:51,855 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 131 transitions. [2024-11-12 13:31:51,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-12 13:31:51,856 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:31:51,856 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:31:51,869 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:31:52,056 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,SelfDestructingSolverStorable16 [2024-11-12 13:31:52,057 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-12 13:31:52,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:31:52,057 INFO L85 PathProgramCache]: Analyzing trace with hash 970282953, now seen corresponding path program 1 times [2024-11-12 13:31:52,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:31:52,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268798186] [2024-11-12 13:31:52,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:31:52,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:31:52,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:52,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:31:52,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:52,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:31:52,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:31:52,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268798186] [2024-11-12 13:31:52,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268798186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:31:52,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:31:52,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 13:31:52,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815726294] [2024-11-12 13:31:52,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:31:52,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 13:31:52,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:31:52,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 13:31:52,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 13:31:52,207 INFO L87 Difference]: Start difference. First operand 114 states and 131 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 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:31:52,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:31:52,366 INFO L93 Difference]: Finished difference Result 138 states and 158 transitions. [2024-11-12 13:31:52,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 13:31:52,367 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 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:31:52,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:31:52,368 INFO L225 Difference]: With dead ends: 138 [2024-11-12 13:31:52,368 INFO L226 Difference]: Without dead ends: 138 [2024-11-12 13:31:52,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-12 13:31:52,369 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 27 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:31:52,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 334 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:31:52,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-12 13:31:52,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 124. [2024-11-12 13:31:52,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 100 states have (on average 1.39) internal successors, (139), 119 states have internal predecessors, (139), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:31:52,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 145 transitions. [2024-11-12 13:31:52,372 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 145 transitions. Word has length 28 [2024-11-12 13:31:52,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:31:52,372 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 145 transitions. [2024-11-12 13:31:52,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 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:31:52,373 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 145 transitions. [2024-11-12 13:31:52,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-12 13:31:52,374 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:31:52,375 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] [2024-11-12 13:31:52,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-12 13:31:52,375 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-12 13:31:52,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:31:52,375 INFO L85 PathProgramCache]: Analyzing trace with hash 971729834, now seen corresponding path program 1 times [2024-11-12 13:31:52,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:31:52,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098504800] [2024-11-12 13:31:52,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:31:52,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:31:52,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:52,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:31:52,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:52,915 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:31:52,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:31:52,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098504800] [2024-11-12 13:31:52,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098504800] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:31:52,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913555561] [2024-11-12 13:31:52,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:31:52,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:31:52,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:31:52,917 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:31:52,919 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:31:53,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:53,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-12 13:31:53,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:31:53,021 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:31:53,040 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:31:53,046 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:31:53,080 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:31:53,087 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:31:53,208 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:31:53,209 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:31:53,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-12 13:31:53,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-12 13:31:53,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:31:53,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:31:53,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-12 13:31:53,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:31:53,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:31:53,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-12 13:31:53,587 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:31:53,587 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:31:54,452 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:31:54,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-12 13:31:54,462 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:31:54,462 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 36 treesize of output 32 [2024-11-12 13:31:54,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 13:31:54,511 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:31:54,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-12 13:31:54,515 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:31:54,521 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-12 13:31:54,522 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 20 treesize of output 11 [2024-11-12 13:31:54,561 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:31:54,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913555561] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:31:54,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:31:54,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 34 [2024-11-12 13:31:54,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009325458] [2024-11-12 13:31:54,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:31:54,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-12 13:31:54,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:31:54,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-12 13:31:54,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1012, Unknown=2, NotChecked=0, Total=1122 [2024-11-12 13:31:54,566 INFO L87 Difference]: Start difference. First operand 124 states and 145 transitions. Second operand has 34 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 30 states have internal predecessors, (62), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-12 13:31:55,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:31:55,097 INFO L93 Difference]: Finished difference Result 120 states and 138 transitions. [2024-11-12 13:31:55,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 13:31:55,097 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 30 states have internal predecessors, (62), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2024-11-12 13:31:55,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:31:55,098 INFO L225 Difference]: With dead ends: 120 [2024-11-12 13:31:55,098 INFO L226 Difference]: Without dead ends: 120 [2024-11-12 13:31:55,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=141, Invalid=1339, Unknown=2, NotChecked=0, Total=1482 [2024-11-12 13:31:55,099 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 22 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 13:31:55,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 884 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 13:31:55,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-12 13:31:55,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-12 13:31:55,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 96 states have (on average 1.375) internal successors, (132), 115 states have internal predecessors, (132), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:31:55,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 138 transitions. [2024-11-12 13:31:55,102 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 138 transitions. Word has length 28 [2024-11-12 13:31:55,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:31:55,102 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 138 transitions. [2024-11-12 13:31:55,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 30 states have internal predecessors, (62), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-12 13:31:55,102 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 138 transitions. [2024-11-12 13:31:55,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-12 13:31:55,103 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:31:55,103 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:31:55,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-12 13:31:55,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:31:55,304 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-12 13:31:55,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:31:55,304 INFO L85 PathProgramCache]: Analyzing trace with hash -333333623, now seen corresponding path program 1 times [2024-11-12 13:31:55,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:31:55,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521365909] [2024-11-12 13:31:55,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:31:55,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:31:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:55,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:31:55,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:55,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 13:31:55,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:55,635 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:31:55,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:31:55,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521365909] [2024-11-12 13:31:55,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521365909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:31:55,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:31:55,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 13:31:55,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757983613] [2024-11-12 13:31:55,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:31:55,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 13:31:55,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:31:55,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 13:31:55,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-12 13:31:55,638 INFO L87 Difference]: Start difference. First operand 120 states and 138 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (2), 1 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:31:55,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:31:55,822 INFO L93 Difference]: Finished difference Result 121 states and 137 transitions. [2024-11-12 13:31:55,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 13:31:55,822 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (2), 1 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 29 [2024-11-12 13:31:55,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:31:55,823 INFO L225 Difference]: With dead ends: 121 [2024-11-12 13:31:55,823 INFO L226 Difference]: Without dead ends: 121 [2024-11-12 13:31:55,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-12 13:31:55,824 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 24 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:31:55,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 361 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:31:55,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-12 13:31:55,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2024-11-12 13:31:55,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 96 states have (on average 1.3645833333333333) internal successors, (131), 115 states have internal predecessors, (131), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:31:55,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 137 transitions. [2024-11-12 13:31:55,827 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 137 transitions. Word has length 29 [2024-11-12 13:31:55,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:31:55,827 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 137 transitions. [2024-11-12 13:31:55,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (2), 1 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:31:55,827 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 137 transitions. [2024-11-12 13:31:55,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-12 13:31:55,827 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:31:55,828 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:31:55,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-12 13:31:55,828 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-12 13:31:55,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:31:55,828 INFO L85 PathProgramCache]: Analyzing trace with hash -333333624, now seen corresponding path program 1 times [2024-11-12 13:31:55,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:31:55,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705835314] [2024-11-12 13:31:55,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:31:55,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:31:55,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:56,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:31:56,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:56,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 13:31:56,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:56,070 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:31:56,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:31:56,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705835314] [2024-11-12 13:31:56,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705835314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:31:56,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:31:56,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 13:31:56,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011550912] [2024-11-12 13:31:56,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:31:56,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 13:31:56,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:31:56,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 13:31:56,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-12 13:31:56,072 INFO L87 Difference]: Start difference. First operand 120 states and 137 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (2), 1 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:31:56,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:31:56,269 INFO L93 Difference]: Finished difference Result 120 states and 136 transitions. [2024-11-12 13:31:56,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 13:31:56,270 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (2), 1 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 29 [2024-11-12 13:31:56,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:31:56,271 INFO L225 Difference]: With dead ends: 120 [2024-11-12 13:31:56,271 INFO L226 Difference]: Without dead ends: 120 [2024-11-12 13:31:56,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-11-12 13:31:56,272 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 21 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:31:56,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 378 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:31:56,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-12 13:31:56,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-12 13:31:56,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 96 states have (on average 1.3541666666666667) internal successors, (130), 115 states have internal predecessors, (130), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:31:56,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 136 transitions. [2024-11-12 13:31:56,276 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 136 transitions. Word has length 29 [2024-11-12 13:31:56,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:31:56,276 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 136 transitions. [2024-11-12 13:31:56,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (2), 1 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:31:56,277 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 136 transitions. [2024-11-12 13:31:56,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-12 13:31:56,277 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:31:56,277 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] [2024-11-12 13:31:56,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-12 13:31:56,278 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-12 13:31:56,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:31:56,278 INFO L85 PathProgramCache]: Analyzing trace with hash 14345560, now seen corresponding path program 1 times [2024-11-12 13:31:56,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:31:56,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982451544] [2024-11-12 13:31:56,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:31:56,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:31:56,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:56,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:31:56,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:56,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:31:56,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:31:56,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982451544] [2024-11-12 13:31:56,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982451544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:31:56,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:31:56,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 13:31:56,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402501250] [2024-11-12 13:31:56,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:31:56,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 13:31:56,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:31:56,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 13:31:56,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-12 13:31:56,382 INFO L87 Difference]: Start difference. First operand 120 states and 136 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 8 states have internal predecessors, (27), 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:31:56,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:31:56,475 INFO L93 Difference]: Finished difference Result 120 states and 132 transitions. [2024-11-12 13:31:56,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 13:31:56,478 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 8 states have internal predecessors, (27), 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 29 [2024-11-12 13:31:56,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:31:56,478 INFO L225 Difference]: With dead ends: 120 [2024-11-12 13:31:56,478 INFO L226 Difference]: Without dead ends: 120 [2024-11-12 13:31:56,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-12 13:31:56,479 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 35 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:31:56,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 407 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:31:56,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-12 13:31:56,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2024-11-12 13:31:56,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 94 states have (on average 1.3085106382978724) internal successors, (123), 113 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:31:56,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 129 transitions. [2024-11-12 13:31:56,482 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 129 transitions. Word has length 29 [2024-11-12 13:31:56,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:31:56,483 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 129 transitions. [2024-11-12 13:31:56,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 8 states have internal predecessors, (27), 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:31:56,483 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 129 transitions. [2024-11-12 13:31:56,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-12 13:31:56,484 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:31:56,484 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] [2024-11-12 13:31:56,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-12 13:31:56,485 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-12 13:31:56,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:31:56,485 INFO L85 PathProgramCache]: Analyzing trace with hash 14000593, now seen corresponding path program 1 times [2024-11-12 13:31:56,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:31:56,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525180930] [2024-11-12 13:31:56,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:31:56,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:31:56,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:56,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:31:56,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:56,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:31:56,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:31:56,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525180930] [2024-11-12 13:31:56,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525180930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:31:56,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:31:56,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 13:31:56,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541693681] [2024-11-12 13:31:56,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:31:56,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 13:31:56,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:31:56,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 13:31:56,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 13:31:56,656 INFO L87 Difference]: Start difference. First operand 118 states and 129 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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:31:56,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:31:56,828 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2024-11-12 13:31:56,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 13:31:56,829 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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 29 [2024-11-12 13:31:56,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:31:56,829 INFO L225 Difference]: With dead ends: 125 [2024-11-12 13:31:56,830 INFO L226 Difference]: Without dead ends: 125 [2024-11-12 13:31:56,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-12 13:31:56,830 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 22 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:31:56,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 295 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:31:56,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-12 13:31:56,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 119. [2024-11-12 13:31:56,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 95 states have (on average 1.305263157894737) internal successors, (124), 114 states have internal predecessors, (124), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:31:56,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 130 transitions. [2024-11-12 13:31:56,833 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 130 transitions. Word has length 29 [2024-11-12 13:31:56,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:31:56,833 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 130 transitions. [2024-11-12 13:31:56,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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:31:56,834 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 130 transitions. [2024-11-12 13:31:56,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-12 13:31:56,834 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:31:56,834 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] [2024-11-12 13:31:56,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-12 13:31:56,834 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-12 13:31:56,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:31:56,835 INFO L85 PathProgramCache]: Analyzing trace with hash 434018507, now seen corresponding path program 1 times [2024-11-12 13:31:56,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:31:56,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050409100] [2024-11-12 13:31:56,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:31:56,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:31:56,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:56,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:31:56,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:56,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:31:56,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:31:56,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050409100] [2024-11-12 13:31:56,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050409100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:31:56,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:31:56,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 13:31:56,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692806509] [2024-11-12 13:31:56,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:31:56,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 13:31:56,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:31:56,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 13:31:56,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-12 13:31:56,984 INFO L87 Difference]: Start difference. First operand 119 states and 130 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:31:57,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:31:57,154 INFO L93 Difference]: Finished difference Result 120 states and 131 transitions. [2024-11-12 13:31:57,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 13:31:57,154 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2024-11-12 13:31:57,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:31:57,155 INFO L225 Difference]: With dead ends: 120 [2024-11-12 13:31:57,155 INFO L226 Difference]: Without dead ends: 120 [2024-11-12 13:31:57,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-12 13:31:57,156 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 16 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:31:57,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 332 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:31:57,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-12 13:31:57,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-12 13:31:57,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 96 states have (on average 1.3020833333333333) internal successors, (125), 115 states have internal predecessors, (125), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:31:57,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 131 transitions. [2024-11-12 13:31:57,159 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 131 transitions. Word has length 30 [2024-11-12 13:31:57,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:31:57,159 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 131 transitions. [2024-11-12 13:31:57,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:31:57,159 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 131 transitions. [2024-11-12 13:31:57,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-12 13:31:57,159 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:31:57,160 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] [2024-11-12 13:31:57,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-12 13:31:57,160 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-12 13:31:57,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:31:57,160 INFO L85 PathProgramCache]: Analyzing trace with hash 479961838, now seen corresponding path program 1 times [2024-11-12 13:31:57,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:31:57,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132559053] [2024-11-12 13:31:57,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:31:57,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:31:57,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:57,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:31:57,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:57,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:31:57,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:31:57,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132559053] [2024-11-12 13:31:57,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132559053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:31:57,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:31:57,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-12 13:31:57,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446549149] [2024-11-12 13:31:57,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:31:57,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 13:31:57,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:31:57,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 13:31:57,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-12 13:31:57,414 INFO L87 Difference]: Start difference. First operand 120 states and 131 transitions. Second operand has 13 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 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:31:57,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:31:57,682 INFO L93 Difference]: Finished difference Result 124 states and 135 transitions. [2024-11-12 13:31:57,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 13:31:57,683 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 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 32 [2024-11-12 13:31:57,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:31:57,684 INFO L225 Difference]: With dead ends: 124 [2024-11-12 13:31:57,684 INFO L226 Difference]: Without dead ends: 124 [2024-11-12 13:31:57,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-11-12 13:31:57,685 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 31 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:31:57,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 307 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:31:57,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-12 13:31:57,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2024-11-12 13:31:57,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 117 states have internal predecessors, (127), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:31:57,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 133 transitions. [2024-11-12 13:31:57,689 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 133 transitions. Word has length 32 [2024-11-12 13:31:57,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:31:57,690 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 133 transitions. [2024-11-12 13:31:57,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 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:31:57,690 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 133 transitions. [2024-11-12 13:31:57,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-12 13:31:57,692 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:31:57,692 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:31:57,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-12 13:31:57,692 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-12 13:31:57,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:31:57,693 INFO L85 PathProgramCache]: Analyzing trace with hash 597065985, now seen corresponding path program 1 times [2024-11-12 13:31:57,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:31:57,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390074846] [2024-11-12 13:31:57,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:31:57,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:31:57,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:57,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:31:57,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:57,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:31:57,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:31:57,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390074846] [2024-11-12 13:31:57,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390074846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:31:57,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:31:57,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 13:31:57,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031026269] [2024-11-12 13:31:57,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:31:57,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 13:31:57,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:31:57,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 13:31:57,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-12 13:31:57,865 INFO L87 Difference]: Start difference. First operand 122 states and 133 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 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:31:58,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:31:58,016 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2024-11-12 13:31:58,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 13:31:58,017 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 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:31:58,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:31:58,017 INFO L225 Difference]: With dead ends: 123 [2024-11-12 13:31:58,018 INFO L226 Difference]: Without dead ends: 123 [2024-11-12 13:31:58,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-12 13:31:58,018 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 26 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:31:58,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 372 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:31:58,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-12 13:31:58,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-12 13:31:58,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 99 states have (on average 1.292929292929293) internal successors, (128), 118 states have internal predecessors, (128), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:31:58,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2024-11-12 13:31:58,023 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 134 transitions. Word has length 35 [2024-11-12 13:31:58,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:31:58,023 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 134 transitions. [2024-11-12 13:31:58,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 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:31:58,023 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2024-11-12 13:31:58,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-12 13:31:58,024 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:31:58,024 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:31:58,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-12 13:31:58,024 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-12 13:31:58,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:31:58,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1733330067, now seen corresponding path program 1 times [2024-11-12 13:31:58,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:31:58,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744699268] [2024-11-12 13:31:58,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:31:58,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:31:58,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:58,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:31:58,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:58,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:31:58,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:31:58,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744699268] [2024-11-12 13:31:58,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744699268] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:31:58,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849630806] [2024-11-12 13:31:58,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:31:58,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:31:58,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:31:58,686 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:31:58,687 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:31:58,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:31:58,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-12 13:31:58,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:31:58,816 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:31:58,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 13:31:58,844 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:31:58,851 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:31:58,860 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:31:58,979 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:31:58,979 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:31:59,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-12 13:31:59,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-12 13:31:59,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:31:59,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:31:59,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-12 13:31:59,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:31:59,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:31:59,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-12 13:31:59,332 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:31:59,333 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2024-11-12 13:31:59,343 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:31:59,343 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 26 [2024-11-12 13:31:59,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:31:59,449 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:31:59,757 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_create_~data~0#1.offset| Int) (v_ArrVal_1382 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~data~0#1.base| v_ArrVal_1382))) (store .cse0 |c_ULTIMATE.start_create_~now~0#1.base| (store (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| |ULTIMATE.start_create_~data~0#1.offset|))) |c_ULTIMATE.start_create_~dll~0#1.base|) 8) 0)) (forall ((v_ArrVal_1384 Int) (v_ArrVal_1383 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~data~0#1.base| v_ArrVal_1383))) (store .cse1 |c_ULTIMATE.start_create_~now~0#1.base| (store (select .cse1 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| v_ArrVal_1384))) |c_ULTIMATE.start_create_~dll~0#1.base|) 8) 0))) is different from false [2024-11-12 13:32:00,124 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_alloc_and_zero_~pi~0.offset 16))) (and (forall ((v_ArrVal_1384 Int) (v_ArrVal_1383 (Array Int Int)) (|v_ULTIMATE.start_create_~now~0#1.offset_21| Int) (|v_ULTIMATE.start_create_~data~0#1.base_14| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_~data~0#1.base_14|) 0)) (= (select (store (select (store (store |c_#memory_$Pointer$#0.base| c_alloc_and_zero_~pi~0.base (store (select |c_#memory_$Pointer$#0.base| c_alloc_and_zero_~pi~0.base) .cse0 0)) |v_ULTIMATE.start_create_~data~0#1.base_14| v_ArrVal_1383) c_alloc_and_zero_~pi~0.base) |v_ULTIMATE.start_create_~now~0#1.offset_21| v_ArrVal_1384) 8) 0) (< c_alloc_and_zero_~pi~0.offset |v_ULTIMATE.start_create_~now~0#1.offset_21|))) (forall ((|ULTIMATE.start_create_~data~0#1.offset| Int) (v_ArrVal_1382 (Array Int Int)) (|v_ULTIMATE.start_create_~now~0#1.offset_21| Int) (|v_ULTIMATE.start_create_~data~0#1.base_14| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_~data~0#1.base_14|) 0)) (= (select (store (select (store (store |c_#memory_$Pointer$#0.offset| c_alloc_and_zero_~pi~0.base (store (select |c_#memory_$Pointer$#0.offset| c_alloc_and_zero_~pi~0.base) .cse0 0)) |v_ULTIMATE.start_create_~data~0#1.base_14| v_ArrVal_1382) c_alloc_and_zero_~pi~0.base) |v_ULTIMATE.start_create_~now~0#1.offset_21| |ULTIMATE.start_create_~data~0#1.offset|) 8) 0) (< c_alloc_and_zero_~pi~0.offset |v_ULTIMATE.start_create_~now~0#1.offset_21|))))) is different from false [2024-11-12 13:32:00,142 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:32:00,142 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2024-11-12 13:32:00,146 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 48 treesize of output 42 [2024-11-12 13:32:00,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-11-12 13:32:00,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:32:00,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 48 [2024-11-12 13:32:00,239 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:32:00,239 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2024-11-12 13:32:00,241 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:32:00,243 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 31 treesize of output 25 [2024-11-12 13:32:00,269 INFO L349 Elim1Store]: treesize reduction 10, result has 47.4 percent of original size [2024-11-12 13:32:00,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 32 [2024-11-12 13:32:00,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:32:00,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849630806] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:32:00,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:32:00,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 44 [2024-11-12 13:32:00,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664320957] [2024-11-12 13:32:00,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:32:00,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-12 13:32:00,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:32:00,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-12 13:32:00,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1591, Unknown=4, NotChecked=162, Total=1892 [2024-11-12 13:32:00,337 INFO L87 Difference]: Start difference. First operand 123 states and 134 transitions. Second operand has 44 states, 44 states have (on average 2.1818181818181817) internal successors, (96), 40 states have internal predecessors, (96), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-12 13:32:01,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:32:01,123 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2024-11-12 13:32:01,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-12 13:32:01,124 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.1818181818181817) internal successors, (96), 40 states have internal predecessors, (96), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2024-11-12 13:32:01,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:32:01,124 INFO L225 Difference]: With dead ends: 128 [2024-11-12 13:32:01,124 INFO L226 Difference]: Without dead ends: 128 [2024-11-12 13:32:01,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=202, Invalid=2352, Unknown=4, NotChecked=198, Total=2756 [2024-11-12 13:32:01,126 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 17 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 13:32:01,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1127 Invalid, 1033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 911 Invalid, 0 Unknown, 115 Unchecked, 0.5s Time] [2024-11-12 13:32:01,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-12 13:32:01,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-11-12 13:32:01,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 104 states have (on average 1.2788461538461537) internal successors, (133), 123 states have internal predecessors, (133), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:32:01,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 139 transitions. [2024-11-12 13:32:01,131 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 139 transitions. Word has length 38 [2024-11-12 13:32:01,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:32:01,132 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 139 transitions. [2024-11-12 13:32:01,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.1818181818181817) internal successors, (96), 40 states have internal predecessors, (96), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-12 13:32:01,132 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 139 transitions. [2024-11-12 13:32:01,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-12 13:32:01,132 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:32:01,132 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, 1, 1] [2024-11-12 13:32:01,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-12 13:32:01,336 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,SelfDestructingSolverStorable26 [2024-11-12 13:32:01,337 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-12 13:32:01,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:32:01,337 INFO L85 PathProgramCache]: Analyzing trace with hash -2101344200, now seen corresponding path program 1 times [2024-11-12 13:32:01,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:32:01,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979422287] [2024-11-12 13:32:01,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:32:01,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:32:01,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:32:01,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:32:01,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:32:01,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:32:01,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:32:01,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979422287] [2024-11-12 13:32:01,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979422287] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:32:01,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602662164] [2024-11-12 13:32:01,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:32:01,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:32:01,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:32:01,741 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:32:01,742 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:32:01,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:32:01,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-12 13:32:01,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:32:02,073 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:32:02,217 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:32:02,217 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 38 treesize of output 30 [2024-11-12 13:32:02,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:32:02,771 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:32:03,051 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 88 treesize of output 80 [2024-11-12 13:32:03,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602662164] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:32:03,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:32:03,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 29 [2024-11-12 13:32:03,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855565387] [2024-11-12 13:32:03,584 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:32:03,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-12 13:32:03,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:32:03,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-12 13:32:03,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1449, Unknown=2, NotChecked=0, Total=1560 [2024-11-12 13:32:03,585 INFO L87 Difference]: Start difference. First operand 128 states and 139 transitions. Second operand has 30 states, 29 states have (on average 2.4827586206896552) internal successors, (72), 26 states have internal predecessors, (72), 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:32:04,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:32:04,672 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2024-11-12 13:32:04,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-12 13:32:04,673 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.4827586206896552) internal successors, (72), 26 states have internal predecessors, (72), 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 39 [2024-11-12 13:32:04,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:32:04,673 INFO L225 Difference]: With dead ends: 130 [2024-11-12 13:32:04,673 INFO L226 Difference]: Without dead ends: 106 [2024-11-12 13:32:04,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=183, Invalid=2167, Unknown=2, NotChecked=0, Total=2352 [2024-11-12 13:32:04,674 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 25 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 13:32:04,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 640 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 906 Invalid, 1 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 13:32:04,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-12 13:32:04,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-12 13:32:04,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 82 states have (on average 1.3414634146341464) internal successors, (110), 101 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:32:04,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2024-11-12 13:32:04,677 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 39 [2024-11-12 13:32:04,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:32:04,677 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2024-11-12 13:32:04,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.4827586206896552) internal successors, (72), 26 states have internal predecessors, (72), 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:32:04,678 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2024-11-12 13:32:04,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-12 13:32:04,678 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:32:04,678 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:32:04,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-12 13:32:04,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-12 13:32:04,879 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-12 13:32:04,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:32:04,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1735997016, now seen corresponding path program 1 times [2024-11-12 13:32:04,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:32:04,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863655607] [2024-11-12 13:32:04,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:32:04,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:32:04,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:32:05,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:32:05,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:32:05,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 13:32:05,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:32:05,114 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:32:05,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:32:05,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863655607] [2024-11-12 13:32:05,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863655607] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:32:05,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056552125] [2024-11-12 13:32:05,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:32:05,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:32:05,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:32:05,116 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:32:05,118 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:32:05,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:32:05,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-12 13:32:05,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:32:05,352 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 13:32:05,352 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:32:05,459 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:32:05,459 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 19 [2024-11-12 13:32:05,517 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 13:32:05,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056552125] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:32:05,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:32:05,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 20 [2024-11-12 13:32:05,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607893627] [2024-11-12 13:32:05,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:32:05,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-12 13:32:05,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:32:05,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-12 13:32:05,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2024-11-12 13:32:05,519 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand has 21 states, 20 states have (on average 4.25) internal successors, (85), 19 states have internal predecessors, (85), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-12 13:32:05,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:32:05,672 INFO L93 Difference]: Finished difference Result 107 states and 117 transitions. [2024-11-12 13:32:05,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 13:32:05,673 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.25) internal successors, (85), 19 states have internal predecessors, (85), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2024-11-12 13:32:05,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:32:05,673 INFO L225 Difference]: With dead ends: 107 [2024-11-12 13:32:05,673 INFO L226 Difference]: Without dead ends: 107 [2024-11-12 13:32:05,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2024-11-12 13:32:05,674 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 7 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:32:05,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 645 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:32:05,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-12 13:32:05,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2024-11-12 13:32:05,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 82 states have (on average 1.329268292682927) internal successors, (109), 101 states have internal predecessors, (109), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:32:05,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 115 transitions. [2024-11-12 13:32:05,676 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 115 transitions. Word has length 41 [2024-11-12 13:32:05,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:32:05,676 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 115 transitions. [2024-11-12 13:32:05,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.25) internal successors, (85), 19 states have internal predecessors, (85), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-12 13:32:05,677 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2024-11-12 13:32:05,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-12 13:32:05,677 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:32:05,677 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:32:05,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-12 13:32:05,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-12 13:32:05,878 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-12 13:32:05,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:32:05,878 INFO L85 PathProgramCache]: Analyzing trace with hash 147897274, now seen corresponding path program 1 times [2024-11-12 13:32:05,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:32:05,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613647938] [2024-11-12 13:32:05,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:32:05,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:32:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:32:06,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:32:06,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:32:06,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 13:32:06,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:32:06,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 13:32:06,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:32:06,211 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 13:32:06,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:32:06,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613647938] [2024-11-12 13:32:06,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613647938] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:32:06,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666861280] [2024-11-12 13:32:06,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:32:06,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:32:06,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:32:06,214 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:32:06,215 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:32:06,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:32:06,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-12 13:32:06,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:32:06,374 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:32:06,374 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:32:06,387 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:32:06,418 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 13:32:06,418 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-12 13:32:06,456 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 13:32:06,456 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-12 13:32:06,464 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 31 treesize of output 13 [2024-11-12 13:32:06,479 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base (select |c_#valid| alloc_and_zero_~pi~0.base))))) is different from true [2024-11-12 13:32:06,504 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-12 13:32:06,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-12 13:32:06,506 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 5 not checked. [2024-11-12 13:32:06,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:32:06,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666861280] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:32:06,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:32:06,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 21 [2024-11-12 13:32:06,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797030118] [2024-11-12 13:32:06,539 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:32:06,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-12 13:32:06,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:32:06,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-12 13:32:06,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=402, Unknown=1, NotChecked=40, Total=506 [2024-11-12 13:32:06,540 INFO L87 Difference]: Start difference. First operand 106 states and 115 transitions. Second operand has 22 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 18 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-12 13:32:06,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:32:06,811 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2024-11-12 13:32:06,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 13:32:06,811 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 18 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2024-11-12 13:32:06,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:32:06,812 INFO L225 Difference]: With dead ends: 104 [2024-11-12 13:32:06,812 INFO L226 Difference]: Without dead ends: 104 [2024-11-12 13:32:06,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=652, Unknown=1, NotChecked=52, Total=812 [2024-11-12 13:32:06,813 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 12 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:32:06,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 545 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 441 Invalid, 0 Unknown, 64 Unchecked, 0.2s Time] [2024-11-12 13:32:06,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-12 13:32:06,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-12 13:32:06,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 82 states have (on average 1.3048780487804879) internal successors, (107), 99 states have internal predecessors, (107), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:32:06,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2024-11-12 13:32:06,815 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 42 [2024-11-12 13:32:06,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:32:06,815 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2024-11-12 13:32:06,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 18 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-12 13:32:06,816 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2024-11-12 13:32:06,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-12 13:32:06,816 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:32:06,816 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:32:06,833 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:32:07,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:32:07,017 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-12 13:32:07,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:32:07,018 INFO L85 PathProgramCache]: Analyzing trace with hash 147897275, now seen corresponding path program 1 times [2024-11-12 13:32:07,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:32:07,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584821436] [2024-11-12 13:32:07,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:32:07,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:32:07,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:32:07,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:32:07,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:32:07,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 13:32:07,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:32:07,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 13:32:07,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:32:07,572 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 13:32:07,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:32:07,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584821436] [2024-11-12 13:32:07,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584821436] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:32:07,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645697874] [2024-11-12 13:32:07,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:32:07,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:32:07,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:32:07,574 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:32:07,575 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:32:07,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:32:07,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-12 13:32:07,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:32:07,754 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:32:07,802 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:32:07,802 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:32:07,828 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:32:07,831 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:32:07,905 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 13:32:07,906 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-12 13:32:07,916 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 30 treesize of output 13 [2024-11-12 13:32:08,012 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 13:32:08,012 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-12 13:32:08,020 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 30 treesize of output 13 [2024-11-12 13:32:08,041 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 42 treesize of output 18 [2024-11-12 13:32:08,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-12 13:32:08,129 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2024-11-12 13:32:08,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:32:08,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-12 13:32:08,155 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:32:08,156 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:32:08,174 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-12 13:32:08,174 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:32:08,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645697874] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:32:08,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:32:08,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 29 [2024-11-12 13:32:08,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984037651] [2024-11-12 13:32:08,262 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:32:08,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-12 13:32:08,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:32:08,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-12 13:32:08,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=835, Unknown=1, NotChecked=58, Total=992 [2024-11-12 13:32:08,264 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand has 30 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 23 states have internal predecessors, (60), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-12 13:32:08,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:32:08,773 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2024-11-12 13:32:08,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-12 13:32:08,774 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 23 states have internal predecessors, (60), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 42 [2024-11-12 13:32:08,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:32:08,774 INFO L225 Difference]: With dead ends: 100 [2024-11-12 13:32:08,775 INFO L226 Difference]: Without dead ends: 100 [2024-11-12 13:32:08,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=194, Invalid=1369, Unknown=1, NotChecked=76, Total=1640 [2024-11-12 13:32:08,776 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 48 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:32:08,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 620 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 553 Invalid, 0 Unknown, 73 Unchecked, 0.3s Time] [2024-11-12 13:32:08,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-12 13:32:08,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-12 13:32:08,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 95 states have internal predecessors, (103), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:32:08,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2024-11-12 13:32:08,780 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 42 [2024-11-12 13:32:08,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:32:08,780 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2024-11-12 13:32:08,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 23 states have internal predecessors, (60), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-12 13:32:08,780 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2024-11-12 13:32:08,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-12 13:32:08,781 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:32:08,781 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:32:08,797 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:32:08,981 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,SelfDestructingSolverStorable30 [2024-11-12 13:32:08,981 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-12 13:32:08,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:32:08,982 INFO L85 PathProgramCache]: Analyzing trace with hash 124992976, now seen corresponding path program 1 times [2024-11-12 13:32:08,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:32:08,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725918672] [2024-11-12 13:32:08,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:32:08,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:32:08,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:32:09,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:32:09,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:32:09,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 13:32:09,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:32:09,562 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 13:32:09,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:32:09,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725918672] [2024-11-12 13:32:09,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725918672] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:32:09,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88384196] [2024-11-12 13:32:09,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:32:09,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:32:09,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:32:09,564 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:32:09,569 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:32:09,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:32:09,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-11-12 13:32:09,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:32:09,896 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:32:10,049 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:32:10,049 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:32:10,059 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:32:10,089 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:32:10,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:32:10,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-12 13:32:10,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:32:10,192 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 40 [2024-11-12 13:32:10,201 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 37 treesize of output 18 [2024-11-12 13:32:10,222 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 20 treesize of output 8 [2024-11-12 13:32:10,254 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 18 [2024-11-12 13:32:10,417 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:32:10,417 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:32:11,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88384196] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:32:11,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:32:11,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 34 [2024-11-12 13:32:11,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592862729] [2024-11-12 13:32:11,048 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:32:11,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-12 13:32:11,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:32:11,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-12 13:32:11,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1804, Unknown=11, NotChecked=0, Total=1980 [2024-11-12 13:32:11,049 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand has 35 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 30 states have internal predecessors, (83), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-12 13:32:11,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:32:11,499 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2024-11-12 13:32:11,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-12 13:32:11,499 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 30 states have internal predecessors, (83), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 47 [2024-11-12 13:32:11,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:32:11,500 INFO L225 Difference]: With dead ends: 112 [2024-11-12 13:32:11,500 INFO L226 Difference]: Without dead ends: 112 [2024-11-12 13:32:11,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 596 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=265, Invalid=2586, Unknown=11, NotChecked=0, Total=2862 [2024-11-12 13:32:11,501 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 55 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:32:11,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 718 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 13:32:11,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-12 13:32:11,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 101. [2024-11-12 13:32:11,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 83 states have (on average 1.2530120481927711) internal successors, (104), 96 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:32:11,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2024-11-12 13:32:11,505 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 47 [2024-11-12 13:32:11,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:32:11,505 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2024-11-12 13:32:11,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 30 states have internal predecessors, (83), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-12 13:32:11,506 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2024-11-12 13:32:11,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-12 13:32:11,506 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:32:11,506 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-12 13:32:11,521 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:32:11,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:32:11,707 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-12 13:32:11,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:32:11,707 INFO L85 PathProgramCache]: Analyzing trace with hash 126439857, now seen corresponding path program 1 times [2024-11-12 13:32:11,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:32:11,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992839739] [2024-11-12 13:32:11,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:32:11,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:32:11,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:32:12,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:32:12,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:32:12,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 13:32:12,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:32:12,318 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:32:12,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:32:12,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992839739] [2024-11-12 13:32:12,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992839739] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:32:12,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311810642] [2024-11-12 13:32:12,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:32:12,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:32:12,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:32:12,320 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:32:12,321 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:32:12,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:32:12,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-12 13:32:12,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:32:12,681 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:32:12,681 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:32:12,724 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:32:12,728 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:32:12,768 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 19 treesize of output 7 [2024-11-12 13:32:12,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:32:12,808 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 37 [2024-11-12 13:32:12,891 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 13:32:12,891 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-12 13:32:13,037 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 25 treesize of output 13 [2024-11-12 13:32:13,044 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:32:13,044 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:32:13,244 INFO L349 Elim1Store]: treesize reduction 5, result has 88.4 percent of original size [2024-11-12 13:32:13,244 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 47 treesize of output 46 [2024-11-12 13:32:13,381 INFO L349 Elim1Store]: treesize reduction 19, result has 69.4 percent of original size [2024-11-12 13:32:13,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 102 [2024-11-12 13:32:13,406 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:32:13,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 155 treesize of output 162 [2024-11-12 13:32:13,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 84 [2024-11-12 13:32:13,568 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:32:13,568 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 67 treesize of output 67 [2024-11-12 13:32:13,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311810642] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:32:13,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:32:13,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 37 [2024-11-12 13:32:13,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816001058] [2024-11-12 13:32:13,728 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:32:13,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-12 13:32:13,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:32:13,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-12 13:32:13,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1994, Unknown=8, NotChecked=0, Total=2162 [2024-11-12 13:32:13,730 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 38 states, 37 states have (on average 2.108108108108108) internal successors, (78), 32 states have internal predecessors, (78), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-12 13:32:14,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:32:14,216 INFO L93 Difference]: Finished difference Result 108 states and 120 transitions. [2024-11-12 13:32:14,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-12 13:32:14,216 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.108108108108108) internal successors, (78), 32 states have internal predecessors, (78), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 47 [2024-11-12 13:32:14,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:32:14,217 INFO L225 Difference]: With dead ends: 108 [2024-11-12 13:32:14,217 INFO L226 Difference]: Without dead ends: 108 [2024-11-12 13:32:14,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=257, Invalid=2815, Unknown=8, NotChecked=0, Total=3080 [2024-11-12 13:32:14,218 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 19 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:32:14,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 905 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 13:32:14,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-12 13:32:14,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2024-11-12 13:32:14,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 89 states have (on average 1.2584269662921348) internal successors, (112), 102 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:32:14,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2024-11-12 13:32:14,220 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 47 [2024-11-12 13:32:14,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:32:14,220 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2024-11-12 13:32:14,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.108108108108108) internal successors, (78), 32 states have internal predecessors, (78), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-12 13:32:14,220 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2024-11-12 13:32:14,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-12 13:32:14,220 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:32:14,221 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-12 13:32:14,234 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:32:14,421 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,SelfDestructingSolverStorable32 [2024-11-12 13:32:14,421 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-12 13:32:14,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:32:14,422 INFO L85 PathProgramCache]: Analyzing trace with hash 126439858, now seen corresponding path program 1 times [2024-11-12 13:32:14,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:32:14,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605305826] [2024-11-12 13:32:14,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:32:14,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:32:14,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:32:14,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:32:14,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:32:15,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 13:32:15,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:32:15,069 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:32:15,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:32:15,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605305826] [2024-11-12 13:32:15,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605305826] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:32:15,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273422929] [2024-11-12 13:32:15,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:32:15,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:32:15,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:32:15,071 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:32:15,072 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:32:15,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:32:15,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 80 conjuncts are in the unsatisfiable core [2024-11-12 13:32:15,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:32:15,335 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:32:15,384 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:32:15,384 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:32:15,418 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:32:15,422 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:32:15,503 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 13:32:15,503 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-12 13:32:15,508 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 30 treesize of output 13 [2024-11-12 13:32:15,562 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 13:32:15,562 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-12 13:32:15,567 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 30 treesize of output 13 [2024-11-12 13:32:15,709 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 25 treesize of output 13 [2024-11-12 13:32:15,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-12 13:32:15,770 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:32:15,770 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:32:16,263 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:32:16,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 47 [2024-11-12 13:32:16,269 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:32:16,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2024-11-12 13:32:16,273 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 64 treesize of output 52 [2024-11-12 13:32:16,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:32:16,282 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 220 treesize of output 207 [2024-11-12 13:32:16,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 70 [2024-11-12 13:32:16,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2024-11-12 13:32:16,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 80 [2024-11-12 13:32:16,337 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-12 13:32:16,338 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 1 [2024-11-12 13:32:16,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273422929] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:32:16,442 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:32:16,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 37 [2024-11-12 13:32:16,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304650826] [2024-11-12 13:32:16,442 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:32:16,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-12 13:32:16,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:32:16,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-12 13:32:16,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=2260, Unknown=4, NotChecked=0, Total=2450 [2024-11-12 13:32:16,444 INFO L87 Difference]: Start difference. First operand 107 states and 118 transitions. Second operand has 38 states, 37 states have (on average 2.27027027027027) internal successors, (84), 32 states have internal predecessors, (84), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-12 13:32:16,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:32:16,938 INFO L93 Difference]: Finished difference Result 108 states and 119 transitions. [2024-11-12 13:32:16,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-12 13:32:16,938 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.27027027027027) internal successors, (84), 32 states have internal predecessors, (84), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 47 [2024-11-12 13:32:16,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:32:16,939 INFO L225 Difference]: With dead ends: 108 [2024-11-12 13:32:16,939 INFO L226 Difference]: Without dead ends: 108 [2024-11-12 13:32:16,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 932 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=261, Invalid=2815, Unknown=4, NotChecked=0, Total=3080 [2024-11-12 13:32:16,940 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 24 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:32:16,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 988 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 13:32:16,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-12 13:32:16,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2024-11-12 13:32:16,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 89 states have (on average 1.247191011235955) internal successors, (111), 102 states have internal predecessors, (111), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:32:16,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 117 transitions. [2024-11-12 13:32:16,942 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 117 transitions. Word has length 47 [2024-11-12 13:32:16,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:32:16,942 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 117 transitions. [2024-11-12 13:32:16,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.27027027027027) internal successors, (84), 32 states have internal predecessors, (84), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-12 13:32:16,943 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 117 transitions. [2024-11-12 13:32:16,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-12 13:32:16,943 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:32:16,943 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:32:16,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-12 13:32:17,143 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,SelfDestructingSolverStorable33 [2024-11-12 13:32:17,144 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-12 13:32:17,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:32:17,144 INFO L85 PathProgramCache]: Analyzing trace with hash -767519134, now seen corresponding path program 1 times [2024-11-12 13:32:17,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:32:17,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110161250] [2024-11-12 13:32:17,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:32:17,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:32:17,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:32:17,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:32:17,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:32:17,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 13:32:17,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:32:17,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 13:32:17,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:32:17,757 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 13:32:17,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:32:17,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110161250] [2024-11-12 13:32:17,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110161250] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:32:17,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169491283] [2024-11-12 13:32:17,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:32:17,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:32:17,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:32:17,760 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:32:17,760 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:32:17,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:32:17,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-12 13:32:17,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:32:18,082 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:32:18,082 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:32:18,104 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:32:18,107 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:32:18,135 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 19 treesize of output 7 [2024-11-12 13:32:18,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:32:18,177 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 32 [2024-11-12 13:32:18,229 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 13:32:18,229 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-12 13:32:18,261 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 31 treesize of output 13 [2024-11-12 13:32:18,270 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:32:18,347 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:32:18,348 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:32:18,376 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:32:18,379 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:32:18,443 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 13:32:18,443 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-12 13:32:18,450 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 30 treesize of output 13 [2024-11-12 13:32:18,461 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 31 treesize of output 13 [2024-11-12 13:32:18,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-12 13:32:18,484 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:32:18,485 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:32:18,608 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2729 (Array Int Int)) (v_ArrVal_2728 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2728) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2729) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)))) (forall ((v_ArrVal_2728 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2728) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)))))) is different from false [2024-11-12 13:32:18,616 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:32:18,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2024-11-12 13:32:18,620 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:32:18,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2024-11-12 13:32:18,622 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 62 treesize of output 50 [2024-11-12 13:32:18,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 78 [2024-11-12 13:32:18,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-12 13:32:18,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 13:32:18,636 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:32:18,636 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-12 13:32:18,637 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:32:18,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-12 13:32:18,887 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-12 13:32:18,888 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 22 treesize of output 21 [2024-11-12 13:32:18,890 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2722 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem10#1.base| v_ArrVal_2722) |c_ULTIMATE.start_create_~now~0#1.base|) (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|)) |c_ULTIMATE.start_create_#t~mem10#1.base|)) is different from false [2024-11-12 13:32:18,988 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2722 (Array Int Int)) (v_ArrVal_2720 Int) (|v_ULTIMATE.start_create_#t~mem9#1.offset_30| Int)) (let ((.cse2 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (or (let ((.cse0 (let ((.cse3 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (store |c_#memory_$Pointer$#0.base| .cse3 (store (select |c_#memory_$Pointer$#0.base| .cse3) (+ 16 |v_ULTIMATE.start_create_#t~mem9#1.offset_30|) v_ArrVal_2720))))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_2722) |c_ULTIMATE.start_create_~now~0#1.base|) .cse2) .cse1))) (< |v_ULTIMATE.start_create_#t~mem9#1.offset_30| (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))))) is different from false [2024-11-12 13:32:19,010 INFO L349 Elim1Store]: treesize reduction 31, result has 50.0 percent of original size [2024-11-12 13:32:19,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 90 [2024-11-12 13:32:19,026 INFO L349 Elim1Store]: treesize reduction 3, result has 76.9 percent of original size [2024-11-12 13:32:19,026 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 119 treesize of output 93 [2024-11-12 13:32:19,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-12 13:32:19,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2024-11-12 13:32:19,152 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 3 not checked. [2024-11-12 13:32:19,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169491283] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:32:19,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:32:19,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23, 19] total 56 [2024-11-12 13:32:19,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793033990] [2024-11-12 13:32:19,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:32:19,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-11-12 13:32:19,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:32:19,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-11-12 13:32:19,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=2635, Unknown=40, NotChecked=318, Total=3192 [2024-11-12 13:32:19,154 INFO L87 Difference]: Start difference. First operand 107 states and 117 transitions. Second operand has 57 states, 56 states have (on average 1.9285714285714286) internal successors, (108), 47 states have internal predecessors, (108), 4 states have call successors, (6), 4 states have call predecessors, (6), 8 states have return successors, (8), 8 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-12 13:32:19,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:32:19,940 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2024-11-12 13:32:19,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-12 13:32:19,941 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 1.9285714285714286) internal successors, (108), 47 states have internal predecessors, (108), 4 states have call successors, (6), 4 states have call predecessors, (6), 8 states have return successors, (8), 8 states have call predecessors, (8), 4 states have call successors, (8) Word has length 48 [2024-11-12 13:32:19,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:32:19,941 INFO L225 Difference]: With dead ends: 106 [2024-11-12 13:32:19,941 INFO L226 Difference]: Without dead ends: 106 [2024-11-12 13:32:19,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 958 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=354, Invalid=3650, Unknown=40, NotChecked=378, Total=4422 [2024-11-12 13:32:19,942 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 59 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 1315 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 120 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 13:32:19,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 1315 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 710 Invalid, 0 Unknown, 120 Unchecked, 0.4s Time] [2024-11-12 13:32:19,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-12 13:32:19,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-12 13:32:19,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.2359550561797752) internal successors, (110), 101 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:32:19,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2024-11-12 13:32:19,944 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 48 [2024-11-12 13:32:19,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:32:19,945 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2024-11-12 13:32:19,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 1.9285714285714286) internal successors, (108), 47 states have internal predecessors, (108), 4 states have call successors, (6), 4 states have call predecessors, (6), 8 states have return successors, (8), 8 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-12 13:32:19,945 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2024-11-12 13:32:19,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-12 13:32:19,945 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:32:19,945 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:32:19,959 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:32:20,145 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,SelfDestructingSolverStorable34 [2024-11-12 13:32:20,146 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-12 13:32:20,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:32:20,146 INFO L85 PathProgramCache]: Analyzing trace with hash -420184918, now seen corresponding path program 1 times [2024-11-12 13:32:20,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:32:20,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175082722] [2024-11-12 13:32:20,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:32:20,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:32:20,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:32:20,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:32:20,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:32:20,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 13:32:20,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:32:20,650 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 13:32:20,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:32:20,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175082722] [2024-11-12 13:32:20,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175082722] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:32:20,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027017104] [2024-11-12 13:32:20,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:32:20,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:32:20,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:32:20,655 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:32:20,657 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:32:20,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:32:20,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-11-12 13:32:20,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:32:20,912 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:32:20,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-11-12 13:32:21,046 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:32:21,047 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:32:21,055 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 18 treesize of output 13 [2024-11-12 13:32:21,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:32:21,100 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 29 treesize of output 13 [2024-11-12 13:32:21,107 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:32:21,164 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 19 treesize of output 7 [2024-11-12 13:32:21,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:32:21,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:32:21,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:32:21,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 44 [2024-11-12 13:32:21,303 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 13:32:21,304 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2024-11-12 13:32:21,448 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:32:21,449 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 25 treesize of output 13 [2024-11-12 13:32:21,451 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:32:21,451 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:32:21,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027017104] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:32:21,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:32:21,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 35 [2024-11-12 13:32:21,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047180041] [2024-11-12 13:32:21,926 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:32:21,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-12 13:32:21,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:32:21,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-12 13:32:21,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1881, Unknown=16, NotChecked=0, Total=2070 [2024-11-12 13:32:21,927 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand has 36 states, 35 states have (on average 2.4) internal successors, (84), 31 states have internal predecessors, (84), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-12 13:32:22,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:32:22,494 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2024-11-12 13:32:22,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-12 13:32:22,495 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.4) internal successors, (84), 31 states have internal predecessors, (84), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 48 [2024-11-12 13:32:22,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:32:22,495 INFO L225 Difference]: With dead ends: 116 [2024-11-12 13:32:22,496 INFO L226 Difference]: Without dead ends: 116 [2024-11-12 13:32:22,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=276, Invalid=2678, Unknown=16, NotChecked=0, Total=2970 [2024-11-12 13:32:22,497 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 43 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:32:22,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 701 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 13:32:22,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-12 13:32:22,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 107. [2024-11-12 13:32:22,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 90 states have (on average 1.2333333333333334) internal successors, (111), 102 states have internal predecessors, (111), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:32:22,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 117 transitions. [2024-11-12 13:32:22,499 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 117 transitions. Word has length 48 [2024-11-12 13:32:22,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:32:22,500 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 117 transitions. [2024-11-12 13:32:22,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.4) internal successors, (84), 31 states have internal predecessors, (84), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-12 13:32:22,500 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 117 transitions. [2024-11-12 13:32:22,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-12 13:32:22,500 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:32:22,500 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:32:22,515 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:32:22,701 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,SelfDestructingSolverStorable35 [2024-11-12 13:32:22,701 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-12 13:32:22,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:32:22,701 INFO L85 PathProgramCache]: Analyzing trace with hash -140830446, now seen corresponding path program 1 times [2024-11-12 13:32:22,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:32:22,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403496695] [2024-11-12 13:32:22,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:32:22,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:32:22,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:32:23,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:32:23,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:32:23,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 13:32:23,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:32:23,177 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 13:32:23,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:32:23,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403496695] [2024-11-12 13:32:23,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403496695] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:32:23,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983395261] [2024-11-12 13:32:23,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:32:23,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:32:23,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:32:23,179 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:32:23,180 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:32:23,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:32:23,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-12 13:32:23,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:32:23,501 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:32:23,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-12 13:32:23,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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:32:23,611 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 13:32:23,612 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 40 [2024-11-12 13:32:23,668 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 13:32:23,668 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 40 [2024-11-12 13:32:23,898 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:32:23,899 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2024-11-12 13:32:23,959 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:32:23,960 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:32:24,454 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|)))) (and (forall ((|v_ULTIMATE.start_loop_~l#1.offset_21| Int) (v_ArrVal_3047 (Array Int Int))) (or (< |v_ULTIMATE.start_loop_~l#1.offset_21| 0) (= |v_ULTIMATE.start_loop_~l#1.offset_21| 0) (< |c_ULTIMATE.start_create_~dll~0#1.offset| |v_ULTIMATE.start_loop_~l#1.offset_21|) (not (= (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_3047) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |v_ULTIMATE.start_loop_~l#1.offset_21| 8)) 0)))) (or (forall ((|v_ULTIMATE.start_loop_~l#1.offset_21| Int) (v_ArrVal_3047 (Array Int Int))) (or (< |v_ULTIMATE.start_loop_~l#1.offset_21| 0) (< |c_ULTIMATE.start_create_~dll~0#1.offset| |v_ULTIMATE.start_loop_~l#1.offset_21|) (not (= (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_3047) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |v_ULTIMATE.start_loop_~l#1.offset_21| 8)) 0)))) (= |c_ULTIMATE.start_create_~dll~0#1.base| 0)))) is different from false [2024-11-12 13:32:24,590 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (and (or (= |c_ULTIMATE.start_create_~dll~0#1.base| 0) (forall ((|v_ULTIMATE.start_loop_~l#1.offset_21| Int) (v_ArrVal_3046 (Array Int Int)) (v_ArrVal_3047 (Array Int Int))) (or (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_3046))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_3047)) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |v_ULTIMATE.start_loop_~l#1.offset_21| 8)) 0)) (< |v_ULTIMATE.start_loop_~l#1.offset_21| 0) (< |c_ULTIMATE.start_create_~dll~0#1.offset| |v_ULTIMATE.start_loop_~l#1.offset_21|)))) (forall ((|v_ULTIMATE.start_loop_~l#1.offset_21| Int) (v_ArrVal_3046 (Array Int Int)) (v_ArrVal_3047 (Array Int Int))) (or (not (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_3046))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_3047)) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |v_ULTIMATE.start_loop_~l#1.offset_21| 8)) 0)) (< |v_ULTIMATE.start_loop_~l#1.offset_21| 0) (= |v_ULTIMATE.start_loop_~l#1.offset_21| 0) (< |c_ULTIMATE.start_create_~dll~0#1.offset| |v_ULTIMATE.start_loop_~l#1.offset_21|)))))) is different from false [2024-11-12 13:32:24,618 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:32:24,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2024-11-12 13:32:24,626 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:32:24,626 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 167 treesize of output 142 [2024-11-12 13:32:24,636 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:32:24,637 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 90 treesize of output 79 [2024-11-12 13:32:24,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2024-11-12 13:32:24,697 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:32:24,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2024-11-12 13:32:24,711 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:32:24,712 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 167 treesize of output 142 [2024-11-12 13:32:24,722 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:32:24,723 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 90 treesize of output 79 [2024-11-12 13:32:24,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2024-11-12 13:32:25,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983395261] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:32:25,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:32:25,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21] total 38 [2024-11-12 13:32:25,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362580508] [2024-11-12 13:32:25,018 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:32:25,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-12 13:32:25,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:32:25,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-12 13:32:25,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=2373, Unknown=17, NotChecked=198, Total=2756 [2024-11-12 13:32:25,019 INFO L87 Difference]: Start difference. First operand 107 states and 117 transitions. Second operand has 38 states, 38 states have (on average 2.3157894736842106) internal successors, (88), 33 states have internal predecessors, (88), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-12 13:32:25,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:32:25,846 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2024-11-12 13:32:25,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-12 13:32:25,847 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.3157894736842106) internal successors, (88), 33 states have internal predecessors, (88), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 49 [2024-11-12 13:32:25,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:32:25,847 INFO L225 Difference]: With dead ends: 111 [2024-11-12 13:32:25,847 INFO L226 Difference]: Without dead ends: 111 [2024-11-12 13:32:25,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=325, Invalid=4220, Unknown=19, NotChecked=266, Total=4830 [2024-11-12 13:32:25,849 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 32 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 13:32:25,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 899 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 13:32:25,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-12 13:32:25,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 108. [2024-11-12 13:32:25,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.2197802197802199) internal successors, (111), 103 states have internal predecessors, (111), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:32:25,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2024-11-12 13:32:25,851 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 49 [2024-11-12 13:32:25,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:32:25,851 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2024-11-12 13:32:25,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.3157894736842106) internal successors, (88), 33 states have internal predecessors, (88), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-12 13:32:25,851 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2024-11-12 13:32:25,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-12 13:32:25,852 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:32:25,852 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:32:25,865 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:32:26,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:32:26,053 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-12 13:32:26,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:32:26,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1019871627, now seen corresponding path program 2 times [2024-11-12 13:32:26,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:32:26,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064345710] [2024-11-12 13:32:26,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:32:26,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:32:26,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:32:26,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:32:26,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:32:26,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 13:32:26,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:32:27,088 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:32:27,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:32:27,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064345710] [2024-11-12 13:32:27,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064345710] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:32:27,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924655184] [2024-11-12 13:32:27,088 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 13:32:27,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:32:27,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:32:27,091 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:32:27,093 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:32:27,292 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 13:32:27,292 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:32:27,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 101 conjuncts are in the unsatisfiable core [2024-11-12 13:32:27,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:32:27,353 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:32:27,356 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:32:27,362 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:32:27,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 19 treesize of output 18 [2024-11-12 13:32:27,450 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:32:27,451 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:32:27,499 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 0 case distinctions, treesize of input 34 treesize of output 36 [2024-11-12 13:32:27,509 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 0 case distinctions, treesize of input 38 treesize of output 29 [2024-11-12 13:32:27,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:32:27,635 INFO L349 Elim1Store]: treesize reduction 27, result has 28.9 percent of original size [2024-11-12 13:32:27,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 105 treesize of output 81 [2024-11-12 13:32:27,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:32:27,648 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2024-11-12 13:32:27,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 52 [2024-11-12 13:32:27,761 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-12 13:32:27,762 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 1 case distinctions, treesize of input 96 treesize of output 65 [2024-11-12 13:32:27,765 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 0 case distinctions, treesize of input 57 treesize of output 39 [2024-11-12 13:32:28,100 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:32:28,100 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:32:47,858 INFO L349 Elim1Store]: treesize reduction 432, result has 29.9 percent of original size [2024-11-12 13:32:47,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 20 new quantified variables, introduced 56 case distinctions, treesize of input 320911 treesize of output 225274 [2024-11-12 13:32:52,111 INFO L349 Elim1Store]: treesize reduction 1393, result has 24.0 percent of original size [2024-11-12 13:32:52,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 18 new quantified variables, introduced 67 case distinctions, treesize of input 143201 treesize of output 122003 [2024-11-12 13:32:55,219 INFO L349 Elim1Store]: treesize reduction 68, result has 82.9 percent of original size [2024-11-12 13:32:55,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 17 new quantified variables, introduced 45 case distinctions, treesize of input 199390 treesize of output 161526 [2024-11-12 13:33:06,214 WARN L286 SmtUtils]: Spent 8.39s on a formula simplification. DAG size of input: 466 DAG size of output: 168 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-12 13:33:06,215 INFO L349 Elim1Store]: treesize reduction 1760, result has 25.8 percent of original size [2024-11-12 13:33:06,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 18 new quantified variables, introduced 92 case distinctions, treesize of input 369015863 treesize of output 194656156