./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-broom/dll-middle-shared.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-broom/dll-middle-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 d8b0e8aa94f77bf1afa5295afab3fc9fce32b5bdbad38c3bd4a8f1e24260f6fc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:51:43,607 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:51:43,681 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-19 06:51:43,686 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:51:43,688 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:51:43,714 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:51:43,715 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:51:43,716 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:51:43,716 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:51:43,719 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:51:43,720 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:51:43,720 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:51:43,721 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:51:43,722 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:51:43,722 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:51:43,723 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:51:43,723 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:51:43,723 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:51:43,724 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:51:43,724 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:51:43,724 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 06:51:43,726 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:51:43,726 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:51:43,726 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:51:43,727 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:51:43,727 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:51:43,727 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:51:43,728 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:51:43,728 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:51:43,728 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:51:43,728 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:51:43,729 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:51:43,729 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:51:43,730 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:51:43,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:51:43,731 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:51:43,731 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:51:43,732 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:51:43,732 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:51:43,732 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 -> d8b0e8aa94f77bf1afa5295afab3fc9fce32b5bdbad38c3bd4a8f1e24260f6fc [2024-11-19 06:51:43,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:51:44,016 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:51:44,019 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:51:44,021 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:51:44,021 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:51:44,022 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/dll-middle-shared.i [2024-11-19 06:51:45,484 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:51:45,752 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:51:45,753 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/dll-middle-shared.i [2024-11-19 06:51:45,780 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aae22c791/0af40ecf49904587a084e5e23755fc8e/FLAGe6a9e271f [2024-11-19 06:51:45,798 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aae22c791/0af40ecf49904587a084e5e23755fc8e [2024-11-19 06:51:45,802 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:51:45,804 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:51:45,807 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:51:45,807 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:51:45,813 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:51:45,814 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:51:45" (1/1) ... [2024-11-19 06:51:45,816 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29ca13b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:51:45, skipping insertion in model container [2024-11-19 06:51:45,817 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:51:45" (1/1) ... [2024-11-19 06:51:45,875 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:51:46,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:51:46,205 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:51:46,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:51:46,288 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:51:46,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:51:46 WrapperNode [2024-11-19 06:51:46,289 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:51:46,289 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:51:46,290 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:51:46,290 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:51:46,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:51:46" (1/1) ... [2024-11-19 06:51:46,310 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:51:46" (1/1) ... [2024-11-19 06:51:46,331 INFO L138 Inliner]: procedures = 121, calls = 34, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 99 [2024-11-19 06:51:46,332 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:51:46,332 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:51:46,332 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:51:46,332 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:51:46,342 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:51:46" (1/1) ... [2024-11-19 06:51:46,343 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:51:46" (1/1) ... [2024-11-19 06:51:46,346 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:51:46" (1/1) ... [2024-11-19 06:51:46,371 INFO L175 MemorySlicer]: Split 20 memory accesses to 1 slices as follows [20]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 10 writes are split as follows [10]. [2024-11-19 06:51:46,375 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:51:46" (1/1) ... [2024-11-19 06:51:46,375 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:51:46" (1/1) ... [2024-11-19 06:51:46,384 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:51:46" (1/1) ... [2024-11-19 06:51:46,387 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:51:46" (1/1) ... [2024-11-19 06:51:46,388 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:51:46" (1/1) ... [2024-11-19 06:51:46,390 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:51:46" (1/1) ... [2024-11-19 06:51:46,393 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:51:46,394 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:51:46,394 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:51:46,394 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:51:46,395 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:51:46" (1/1) ... [2024-11-19 06:51:46,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:51:46,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:51:46,428 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-19 06:51:46,430 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-19 06:51:46,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 06:51:46,472 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2024-11-19 06:51:46,472 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2024-11-19 06:51:46,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:51:46,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 06:51:46,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:51:46,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:51:46,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:51:46,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:51:46,613 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:51:46,615 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:51:46,980 INFO L? ?]: Removed 118 outVars from TransFormulas that were not future-live. [2024-11-19 06:51:46,980 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:51:46,996 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:51:46,997 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-19 06:51:46,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:51:46 BoogieIcfgContainer [2024-11-19 06:51:46,998 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:51:46,999 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:51:47,000 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:51:47,006 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:51:47,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:51:45" (1/3) ... [2024-11-19 06:51:47,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f384b58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:51:47, skipping insertion in model container [2024-11-19 06:51:47,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:51:46" (2/3) ... [2024-11-19 06:51:47,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f384b58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:51:47, skipping insertion in model container [2024-11-19 06:51:47,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:51:46" (3/3) ... [2024-11-19 06:51:47,009 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-middle-shared.i [2024-11-19 06:51:47,023 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:51:47,023 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 50 error locations. [2024-11-19 06:51:47,058 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:51:47,064 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;@2e045e67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:51:47,064 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2024-11-19 06:51:47,068 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 57 states have (on average 2.0) internal successors, (114), 107 states have internal predecessors, (114), 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-19 06:51:47,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-19 06:51:47,073 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:51:47,073 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 06:51:47,074 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 47 more)] === [2024-11-19 06:51:47,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:51:47,079 INFO L85 PathProgramCache]: Analyzing trace with hash 37412693, now seen corresponding path program 1 times [2024-11-19 06:51:47,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:51:47,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491403764] [2024-11-19 06:51:47,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:51:47,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:51:47,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:51:47,304 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-19 06:51:47,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:51:47,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491403764] [2024-11-19 06:51:47,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491403764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:51:47,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:51:47,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:51:47,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244873674] [2024-11-19 06:51:47,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:51:47,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:51:47,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:51:47,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:51:47,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:51:47,348 INFO L87 Difference]: Start difference. First operand has 111 states, 57 states have (on average 2.0) internal successors, (114), 107 states have internal predecessors, (114), 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-19 06:51:47,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:51:47,533 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2024-11-19 06:51:47,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:51:47,536 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-19 06:51:47,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:51:47,542 INFO L225 Difference]: With dead ends: 109 [2024-11-19 06:51:47,543 INFO L226 Difference]: Without dead ends: 107 [2024-11-19 06:51:47,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:51:47,547 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 2 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:51:47,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 167 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:51:47,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-19 06:51:47,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-19 06:51:47,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 56 states have (on average 1.9107142857142858) internal successors, (107), 103 states have internal predecessors, (107), 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-19 06:51:47,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2024-11-19 06:51:47,583 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 5 [2024-11-19 06:51:47,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:51:47,583 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2024-11-19 06:51:47,583 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-19 06:51:47,583 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2024-11-19 06:51:47,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-19 06:51:47,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:51:47,584 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 06:51:47,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 06:51:47,584 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 47 more)] === [2024-11-19 06:51:47,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:51:47,585 INFO L85 PathProgramCache]: Analyzing trace with hash 37412694, now seen corresponding path program 1 times [2024-11-19 06:51:47,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:51:47,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307144905] [2024-11-19 06:51:47,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:51:47,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:51:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:51:47,694 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-19 06:51:47,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:51:47,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307144905] [2024-11-19 06:51:47,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307144905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:51:47,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:51:47,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:51:47,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348183751] [2024-11-19 06:51:47,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:51:47,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:51:47,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:51:47,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:51:47,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:51:47,699 INFO L87 Difference]: Start difference. First operand 107 states and 111 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-19 06:51:47,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:51:47,793 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2024-11-19 06:51:47,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:51:47,793 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-19 06:51:47,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:51:47,794 INFO L225 Difference]: With dead ends: 105 [2024-11-19 06:51:47,794 INFO L226 Difference]: Without dead ends: 105 [2024-11-19 06:51:47,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:51:47,796 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 2 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:51:47,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 173 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:51:47,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-19 06:51:47,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-19 06:51:47,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 56 states have (on average 1.875) internal successors, (105), 101 states have internal predecessors, (105), 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-19 06:51:47,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2024-11-19 06:51:47,812 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 5 [2024-11-19 06:51:47,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:51:47,812 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2024-11-19 06:51:47,812 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-19 06:51:47,813 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2024-11-19 06:51:47,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 06:51:47,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:51:47,814 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:51:47,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 06:51:47,814 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 47 more)] === [2024-11-19 06:51:47,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:51:47,815 INFO L85 PathProgramCache]: Analyzing trace with hash -551619895, now seen corresponding path program 1 times [2024-11-19 06:51:47,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:51:47,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439448237] [2024-11-19 06:51:47,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:51:47,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:51:47,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:51:47,972 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-19 06:51:47,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:51:47,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439448237] [2024-11-19 06:51:47,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439448237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:51:47,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:51:47,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:51:47,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288284739] [2024-11-19 06:51:47,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:51:47,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:51:47,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:51:47,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:51:47,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:51:47,978 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand has 3 states, 2 states have (on average 4.5) 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-19 06:51:48,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:51:48,058 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2024-11-19 06:51:48,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:51:48,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) 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-19 06:51:48,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:51:48,063 INFO L225 Difference]: With dead ends: 109 [2024-11-19 06:51:48,063 INFO L226 Difference]: Without dead ends: 109 [2024-11-19 06:51:48,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:51:48,065 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 15 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:51:48,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 158 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:51:48,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-19 06:51:48,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 104. [2024-11-19 06:51:48,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 56 states have (on average 1.8571428571428572) internal successors, (104), 100 states have internal predecessors, (104), 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-19 06:51:48,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2024-11-19 06:51:48,079 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 11 [2024-11-19 06:51:48,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:51:48,081 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2024-11-19 06:51:48,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) 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-19 06:51:48,081 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2024-11-19 06:51:48,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 06:51:48,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:51:48,082 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:51:48,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 06:51:48,082 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 47 more)] === [2024-11-19 06:51:48,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:51:48,082 INFO L85 PathProgramCache]: Analyzing trace with hash -551619896, now seen corresponding path program 1 times [2024-11-19 06:51:48,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:51:48,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375978442] [2024-11-19 06:51:48,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:51:48,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:51:48,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:51:48,143 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-19 06:51:48,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:51:48,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375978442] [2024-11-19 06:51:48,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375978442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:51:48,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:51:48,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:51:48,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362746538] [2024-11-19 06:51:48,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:51:48,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:51:48,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:51:48,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:51:48,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:51:48,145 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand has 3 states, 2 states have (on average 4.5) 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-19 06:51:48,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:51:48,223 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2024-11-19 06:51:48,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:51:48,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) 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-19 06:51:48,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:51:48,225 INFO L225 Difference]: With dead ends: 108 [2024-11-19 06:51:48,225 INFO L226 Difference]: Without dead ends: 108 [2024-11-19 06:51:48,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:51:48,227 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 15 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:51:48,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 150 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:51:48,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-19 06:51:48,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 103. [2024-11-19 06:51:48,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 56 states have (on average 1.8392857142857142) internal successors, (103), 99 states have internal predecessors, (103), 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-19 06:51:48,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2024-11-19 06:51:48,238 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 11 [2024-11-19 06:51:48,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:51:48,238 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2024-11-19 06:51:48,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) 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-19 06:51:48,239 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2024-11-19 06:51:48,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 06:51:48,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:51:48,240 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:51:48,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 06:51:48,240 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 47 more)] === [2024-11-19 06:51:48,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:51:48,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1825743063, now seen corresponding path program 1 times [2024-11-19 06:51:48,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:51:48,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649199863] [2024-11-19 06:51:48,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:51:48,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:51:48,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:51:48,325 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-19 06:51:48,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:51:48,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649199863] [2024-11-19 06:51:48,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649199863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:51:48,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:51:48,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:51:48,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533224337] [2024-11-19 06:51:48,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:51:48,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:51:48,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:51:48,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:51:48,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:51:48,331 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:51:48,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:51:48,402 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2024-11-19 06:51:48,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:51:48,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-19 06:51:48,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:51:48,404 INFO L225 Difference]: With dead ends: 107 [2024-11-19 06:51:48,405 INFO L226 Difference]: Without dead ends: 107 [2024-11-19 06:51:48,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:51:48,406 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 12 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:51:48,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 151 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:51:48,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-19 06:51:48,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 102. [2024-11-19 06:51:48,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 56 states have (on average 1.8214285714285714) internal successors, (102), 98 states have internal predecessors, (102), 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-19 06:51:48,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 106 transitions. [2024-11-19 06:51:48,419 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 106 transitions. Word has length 13 [2024-11-19 06:51:48,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:51:48,419 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 106 transitions. [2024-11-19 06:51:48,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:51:48,420 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2024-11-19 06:51:48,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 06:51:48,420 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:51:48,421 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:51:48,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 06:51:48,421 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 47 more)] === [2024-11-19 06:51:48,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:51:48,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1825743062, now seen corresponding path program 1 times [2024-11-19 06:51:48,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:51:48,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702864192] [2024-11-19 06:51:48,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:51:48,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:51:48,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:51:48,601 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-19 06:51:48,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:51:48,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702864192] [2024-11-19 06:51:48,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702864192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:51:48,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:51:48,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:51:48,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523253746] [2024-11-19 06:51:48,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:51:48,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:51:48,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:51:48,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:51:48,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:51:48,605 INFO L87 Difference]: Start difference. First operand 102 states and 106 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:51:48,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:51:48,681 INFO L93 Difference]: Finished difference Result 106 states and 112 transitions. [2024-11-19 06:51:48,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:51:48,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-19 06:51:48,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:51:48,683 INFO L225 Difference]: With dead ends: 106 [2024-11-19 06:51:48,683 INFO L226 Difference]: Without dead ends: 106 [2024-11-19 06:51:48,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:51:48,684 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 12 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:51:48,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 159 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:51:48,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-19 06:51:48,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 101. [2024-11-19 06:51:48,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 56 states have (on average 1.8035714285714286) internal successors, (101), 97 states have internal predecessors, (101), 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-19 06:51:48,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2024-11-19 06:51:48,698 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 13 [2024-11-19 06:51:48,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:51:48,698 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2024-11-19 06:51:48,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:51:48,699 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2024-11-19 06:51:48,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 06:51:48,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:51:48,702 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:51:48,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 06:51:48,702 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 06:51:48,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:51:48,703 INFO L85 PathProgramCache]: Analyzing trace with hash 2102540234, now seen corresponding path program 1 times [2024-11-19 06:51:48,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:51:48,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995946627] [2024-11-19 06:51:48,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:51:48,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:51:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:51:48,958 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-19 06:51:48,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:51:48,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995946627] [2024-11-19 06:51:48,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995946627] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:51:48,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:51:48,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:51:48,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211584477] [2024-11-19 06:51:48,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:51:48,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:51:48,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:51:48,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:51:48,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:51:48,962 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:51:49,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:51:49,127 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2024-11-19 06:51:49,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:51:49,128 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-19 06:51:49,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:51:49,129 INFO L225 Difference]: With dead ends: 100 [2024-11-19 06:51:49,129 INFO L226 Difference]: Without dead ends: 100 [2024-11-19 06:51:49,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:51:49,130 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 44 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:51:49,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 249 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:51:49,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-19 06:51:49,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2024-11-19 06:51:49,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 56 states have (on average 1.6964285714285714) internal successors, (95), 91 states have internal predecessors, (95), 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-19 06:51:49,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2024-11-19 06:51:49,139 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 15 [2024-11-19 06:51:49,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:51:49,139 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2024-11-19 06:51:49,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:51:49,140 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2024-11-19 06:51:49,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 06:51:49,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:51:49,141 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:51:49,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 06:51:49,141 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 06:51:49,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:51:49,143 INFO L85 PathProgramCache]: Analyzing trace with hash 2102540235, now seen corresponding path program 1 times [2024-11-19 06:51:49,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:51:49,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424096550] [2024-11-19 06:51:49,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:51:49,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:51:49,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:51:49,492 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-19 06:51:49,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:51:49,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424096550] [2024-11-19 06:51:49,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424096550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:51:49,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:51:49,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:51:49,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881656321] [2024-11-19 06:51:49,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:51:49,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:51:49,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:51:49,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:51:49,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:51:49,494 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:51:49,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:51:49,707 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2024-11-19 06:51:49,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:51:49,707 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-19 06:51:49,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:51:49,708 INFO L225 Difference]: With dead ends: 98 [2024-11-19 06:51:49,708 INFO L226 Difference]: Without dead ends: 98 [2024-11-19 06:51:49,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:51:49,710 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 16 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:51:49,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 282 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:51:49,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-19 06:51:49,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 93. [2024-11-19 06:51:49,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 56 states have (on average 1.6607142857142858) internal successors, (93), 89 states have internal predecessors, (93), 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-19 06:51:49,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2024-11-19 06:51:49,721 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 15 [2024-11-19 06:51:49,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:51:49,721 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2024-11-19 06:51:49,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:51:49,721 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2024-11-19 06:51:49,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 06:51:49,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:51:49,722 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:51:49,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 06:51:49,722 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 06:51:49,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:51:49,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1778148713, now seen corresponding path program 1 times [2024-11-19 06:51:49,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:51:49,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97558340] [2024-11-19 06:51:49,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:51:49,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:51:49,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:51:49,839 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-19 06:51:49,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:51:49,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97558340] [2024-11-19 06:51:49,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97558340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:51:49,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:51:49,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:51:49,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560503997] [2024-11-19 06:51:49,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:51:49,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:51:49,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:51:49,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:51:49,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:51:49,842 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:51:49,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:51:49,992 INFO L93 Difference]: Finished difference Result 127 states and 139 transitions. [2024-11-19 06:51:49,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:51:49,993 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-11-19 06:51:49,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:51:49,993 INFO L225 Difference]: With dead ends: 127 [2024-11-19 06:51:49,994 INFO L226 Difference]: Without dead ends: 127 [2024-11-19 06:51:49,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:51:49,994 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 57 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:51:49,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 269 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:51:49,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-19 06:51:50,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 114. [2024-11-19 06:51:50,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 77 states have (on average 1.6753246753246753) internal successors, (129), 109 states have internal predecessors, (129), 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-19 06:51:50,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 135 transitions. [2024-11-19 06:51:50,003 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 135 transitions. Word has length 22 [2024-11-19 06:51:50,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:51:50,003 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 135 transitions. [2024-11-19 06:51:50,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:51:50,004 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 135 transitions. [2024-11-19 06:51:50,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 06:51:50,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:51:50,004 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:51:50,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 06:51:50,005 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 06:51:50,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:51:50,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1778148712, now seen corresponding path program 1 times [2024-11-19 06:51:50,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:51:50,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175993605] [2024-11-19 06:51:50,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:51:50,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:51:50,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:51:50,243 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-19 06:51:50,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:51:50,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175993605] [2024-11-19 06:51:50,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175993605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:51:50,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:51:50,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 06:51:50,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900347979] [2024-11-19 06:51:50,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:51:50,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 06:51:50,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:51:50,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 06:51:50,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:51:50,245 INFO L87 Difference]: Start difference. First operand 114 states and 135 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 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-19 06:51:50,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:51:50,434 INFO L93 Difference]: Finished difference Result 132 states and 148 transitions. [2024-11-19 06:51:50,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:51:50,434 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 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-19 06:51:50,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:51:50,435 INFO L225 Difference]: With dead ends: 132 [2024-11-19 06:51:50,435 INFO L226 Difference]: Without dead ends: 132 [2024-11-19 06:51:50,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:51:50,436 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 31 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:51:50,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 507 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:51:50,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-19 06:51:50,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 123. [2024-11-19 06:51:50,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 86 states have (on average 1.6395348837209303) internal successors, (141), 118 states have internal predecessors, (141), 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-19 06:51:50,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 147 transitions. [2024-11-19 06:51:50,444 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 147 transitions. Word has length 22 [2024-11-19 06:51:50,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:51:50,444 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 147 transitions. [2024-11-19 06:51:50,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 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-19 06:51:50,445 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 147 transitions. [2024-11-19 06:51:50,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 06:51:50,445 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:51:50,445 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:51:50,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 06:51:50,446 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 06:51:50,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:51:50,446 INFO L85 PathProgramCache]: Analyzing trace with hash 596028714, now seen corresponding path program 1 times [2024-11-19 06:51:50,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:51:50,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114987051] [2024-11-19 06:51:50,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:51:50,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:51:50,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:51:50,576 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-19 06:51:50,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:51:50,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114987051] [2024-11-19 06:51:50,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114987051] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:51:50,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:51:50,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 06:51:50,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718031708] [2024-11-19 06:51:50,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:51:50,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:51:50,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:51:50,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:51:50,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:51:50,580 INFO L87 Difference]: Start difference. First operand 123 states and 147 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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-19 06:51:50,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:51:50,628 INFO L93 Difference]: Finished difference Result 137 states and 164 transitions. [2024-11-19 06:51:50,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:51:50,629 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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 24 [2024-11-19 06:51:50,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:51:50,631 INFO L225 Difference]: With dead ends: 137 [2024-11-19 06:51:50,631 INFO L226 Difference]: Without dead ends: 137 [2024-11-19 06:51:50,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:51:50,632 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 34 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:51:50,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 557 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:51:50,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-19 06:51:50,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 125. [2024-11-19 06:51:50,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 88 states have (on average 1.6136363636363635) internal successors, (142), 120 states have internal predecessors, (142), 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-19 06:51:50,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 148 transitions. [2024-11-19 06:51:50,638 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 148 transitions. Word has length 24 [2024-11-19 06:51:50,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:51:50,639 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 148 transitions. [2024-11-19 06:51:50,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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-19 06:51:50,640 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 148 transitions. [2024-11-19 06:51:50,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 06:51:50,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:51:50,641 INFO L215 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-19 06:51:50,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 06:51:50,641 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 06:51:50,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:51:50,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1048895792, now seen corresponding path program 1 times [2024-11-19 06:51:50,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:51:50,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838478116] [2024-11-19 06:51:50,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:51:50,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:51:50,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:51:50,822 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:51:50,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:51:50,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838478116] [2024-11-19 06:51:50,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838478116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:51:50,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:51:50,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:51:50,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62794151] [2024-11-19 06:51:50,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:51:50,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:51:50,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:51:50,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:51:50,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:51:50,825 INFO L87 Difference]: Start difference. First operand 125 states and 148 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:51:50,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:51:50,969 INFO L93 Difference]: Finished difference Result 125 states and 147 transitions. [2024-11-19 06:51:50,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:51:50,970 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2024-11-19 06:51:50,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:51:50,971 INFO L225 Difference]: With dead ends: 125 [2024-11-19 06:51:50,971 INFO L226 Difference]: Without dead ends: 125 [2024-11-19 06:51:50,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:51:50,972 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 19 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:51:50,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 200 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:51:50,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-19 06:51:50,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2024-11-19 06:51:50,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 88 states have (on average 1.6022727272727273) internal successors, (141), 120 states have internal predecessors, (141), 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-19 06:51:50,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 147 transitions. [2024-11-19 06:51:50,980 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 147 transitions. Word has length 26 [2024-11-19 06:51:50,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:51:50,980 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 147 transitions. [2024-11-19 06:51:50,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:51:50,980 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 147 transitions. [2024-11-19 06:51:50,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 06:51:50,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:51:50,981 INFO L215 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-19 06:51:50,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 06:51:50,981 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 06:51:50,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:51:50,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1048895791, now seen corresponding path program 1 times [2024-11-19 06:51:50,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:51:50,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125003475] [2024-11-19 06:51:50,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:51:50,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:51:51,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:51:51,283 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:51:51,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:51:51,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125003475] [2024-11-19 06:51:51,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125003475] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:51:51,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594341445] [2024-11-19 06:51:51,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:51:51,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:51:51,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:51:51,286 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-19 06:51:51,289 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-19 06:51:51,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:51:51,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 06:51:51,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:51:51,554 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-19 06:51:51,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:51:51,638 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 16 treesize of output 11 [2024-11-19 06:51:51,652 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:51:51,652 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-19 06:51:51,672 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:51:51,673 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:51:51,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594341445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:51:51,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 06:51:51,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2024-11-19 06:51:51,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957046458] [2024-11-19 06:51:51,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:51:51,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:51:51,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:51:51,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:51:51,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=170, Unknown=1, NotChecked=26, Total=240 [2024-11-19 06:51:51,675 INFO L87 Difference]: Start difference. First operand 125 states and 147 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:51:51,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:51:51,833 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2024-11-19 06:51:51,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:51:51,834 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2024-11-19 06:51:51,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:51:51,836 INFO L225 Difference]: With dead ends: 131 [2024-11-19 06:51:51,836 INFO L226 Difference]: Without dead ends: 131 [2024-11-19 06:51:51,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=170, Unknown=1, NotChecked=26, Total=240 [2024-11-19 06:51:51,837 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 55 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 142 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:51:51,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 208 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 153 Invalid, 0 Unknown, 142 Unchecked, 0.1s Time] [2024-11-19 06:51:51,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-19 06:51:51,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 125. [2024-11-19 06:51:51,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 88 states have (on average 1.5454545454545454) internal successors, (136), 120 states have internal predecessors, (136), 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-19 06:51:51,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 142 transitions. [2024-11-19 06:51:51,843 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 142 transitions. Word has length 26 [2024-11-19 06:51:51,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:51:51,843 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 142 transitions. [2024-11-19 06:51:51,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:51:51,844 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 142 transitions. [2024-11-19 06:51:51,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 06:51:51,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:51:51,844 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:51:51,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 06:51:52,045 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-19 06:51:52,046 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 06:51:52,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:51:52,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1594937595, now seen corresponding path program 1 times [2024-11-19 06:51:52,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:51:52,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613004565] [2024-11-19 06:51:52,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:51:52,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:51:52,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:51:52,176 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-19 06:51:52,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:51:52,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613004565] [2024-11-19 06:51:52,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613004565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:51:52,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:51:52,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:51:52,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626125783] [2024-11-19 06:51:52,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:51:52,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:51:52,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:51:52,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:51:52,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:51:52,179 INFO L87 Difference]: Start difference. First operand 125 states and 142 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:51:52,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:51:52,326 INFO L93 Difference]: Finished difference Result 144 states and 158 transitions. [2024-11-19 06:51:52,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:51:52,328 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-11-19 06:51:52,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:51:52,329 INFO L225 Difference]: With dead ends: 144 [2024-11-19 06:51:52,329 INFO L226 Difference]: Without dead ends: 144 [2024-11-19 06:51:52,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:51:52,330 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 42 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:51:52,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 292 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:51:52,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-19 06:51:52,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 135. [2024-11-19 06:51:52,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 98 states have (on average 1.530612244897959) internal successors, (150), 130 states have internal predecessors, (150), 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-19 06:51:52,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 156 transitions. [2024-11-19 06:51:52,354 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 156 transitions. Word has length 26 [2024-11-19 06:51:52,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:51:52,355 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 156 transitions. [2024-11-19 06:51:52,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:51:52,355 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 156 transitions. [2024-11-19 06:51:52,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 06:51:52,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:51:52,357 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:51:52,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 06:51:52,358 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 06:51:52,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:51:52,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1594937596, now seen corresponding path program 1 times [2024-11-19 06:51:52,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:51:52,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541243007] [2024-11-19 06:51:52,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:51:52,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:51:52,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:51:52,579 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-19 06:51:52,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:51:52,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541243007] [2024-11-19 06:51:52,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541243007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:51:52,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:51:52,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 06:51:52,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986165077] [2024-11-19 06:51:52,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:51:52,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 06:51:52,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:51:52,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 06:51:52,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:51:52,581 INFO L87 Difference]: Start difference. First operand 135 states and 156 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:51:52,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:51:52,728 INFO L93 Difference]: Finished difference Result 139 states and 160 transitions. [2024-11-19 06:51:52,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:51:52,729 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-11-19 06:51:52,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:51:52,729 INFO L225 Difference]: With dead ends: 139 [2024-11-19 06:51:52,730 INFO L226 Difference]: Without dead ends: 139 [2024-11-19 06:51:52,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:51:52,731 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 29 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:51:52,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 557 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:51:52,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-19 06:51:52,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-11-19 06:51:52,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 102 states have (on average 1.5098039215686274) internal successors, (154), 134 states have internal predecessors, (154), 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-19 06:51:52,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 160 transitions. [2024-11-19 06:51:52,737 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 160 transitions. Word has length 26 [2024-11-19 06:51:52,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:51:52,738 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 160 transitions. [2024-11-19 06:51:52,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:51:52,738 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 160 transitions. [2024-11-19 06:51:52,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 06:51:52,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:51:52,740 INFO L215 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-19 06:51:52,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 06:51:52,740 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 06:51:52,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:51:52,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1767449120, now seen corresponding path program 1 times [2024-11-19 06:51:52,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:51:52,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991048000] [2024-11-19 06:51:52,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:51:52,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:51:52,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:51:52,991 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-19 06:51:52,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:51:52,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991048000] [2024-11-19 06:51:52,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991048000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:51:52,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:51:52,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:51:52,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355091869] [2024-11-19 06:51:52,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:51:52,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:51:52,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:51:52,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:51:52,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:51:52,993 INFO L87 Difference]: Start difference. First operand 139 states and 160 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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-19 06:51:53,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:51:53,170 INFO L93 Difference]: Finished difference Result 138 states and 158 transitions. [2024-11-19 06:51:53,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:51:53,171 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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 29 [2024-11-19 06:51:53,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:51:53,172 INFO L225 Difference]: With dead ends: 138 [2024-11-19 06:51:53,172 INFO L226 Difference]: Without dead ends: 138 [2024-11-19 06:51:53,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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-19 06:51:53,173 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 4 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:51:53,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 348 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:51:53,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-19 06:51:53,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-11-19 06:51:53,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 102 states have (on average 1.4901960784313726) internal successors, (152), 133 states have internal predecessors, (152), 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-19 06:51:53,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 158 transitions. [2024-11-19 06:51:53,176 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 158 transitions. Word has length 29 [2024-11-19 06:51:53,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:51:53,177 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 158 transitions. [2024-11-19 06:51:53,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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-19 06:51:53,177 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 158 transitions. [2024-11-19 06:51:53,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 06:51:53,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:51:53,178 INFO L215 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-19 06:51:53,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 06:51:53,178 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 06:51:53,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:51:53,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1767449121, now seen corresponding path program 1 times [2024-11-19 06:51:53,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:51:53,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850984573] [2024-11-19 06:51:53,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:51:53,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:51:53,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:51:53,299 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-19 06:51:53,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:51:53,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850984573] [2024-11-19 06:51:53,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850984573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:51:53,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:51:53,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:51:53,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765464401] [2024-11-19 06:51:53,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:51:53,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:51:53,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:51:53,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:51:53,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:51:53,301 INFO L87 Difference]: Start difference. First operand 138 states and 158 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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-19 06:51:53,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:51:53,462 INFO L93 Difference]: Finished difference Result 137 states and 156 transitions. [2024-11-19 06:51:53,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:51:53,462 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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 29 [2024-11-19 06:51:53,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:51:53,463 INFO L225 Difference]: With dead ends: 137 [2024-11-19 06:51:53,463 INFO L226 Difference]: Without dead ends: 137 [2024-11-19 06:51:53,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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-19 06:51:53,464 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 7 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:51:53,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 313 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:51:53,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-19 06:51:53,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-11-19 06:51:53,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 102 states have (on average 1.4705882352941178) internal successors, (150), 132 states have internal predecessors, (150), 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-19 06:51:53,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 156 transitions. [2024-11-19 06:51:53,468 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 156 transitions. Word has length 29 [2024-11-19 06:51:53,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:51:53,468 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 156 transitions. [2024-11-19 06:51:53,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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-19 06:51:53,468 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 156 transitions. [2024-11-19 06:51:53,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 06:51:53,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:51:53,469 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:51:53,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 06:51:53,469 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 06:51:53,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:51:53,470 INFO L85 PathProgramCache]: Analyzing trace with hash 720196154, now seen corresponding path program 1 times [2024-11-19 06:51:53,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:51:53,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325486516] [2024-11-19 06:51:53,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:51:53,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:51:53,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:51:53,577 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-19 06:51:53,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:51:53,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325486516] [2024-11-19 06:51:53,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325486516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:51:53,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:51:53,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:51:53,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097435729] [2024-11-19 06:51:53,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:51:53,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:51:53,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:51:53,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:51:53,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:51:53,580 INFO L87 Difference]: Start difference. First operand 137 states and 156 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 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-19 06:51:53,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:51:53,767 INFO L93 Difference]: Finished difference Result 157 states and 178 transitions. [2024-11-19 06:51:53,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:51:53,767 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 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 31 [2024-11-19 06:51:53,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:51:53,768 INFO L225 Difference]: With dead ends: 157 [2024-11-19 06:51:53,768 INFO L226 Difference]: Without dead ends: 157 [2024-11-19 06:51:53,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:51:53,769 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 77 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:51:53,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 262 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:51:53,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-19 06:51:53,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 148. [2024-11-19 06:51:53,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 114 states have (on average 1.4912280701754386) internal successors, (170), 143 states have internal predecessors, (170), 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-19 06:51:53,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 176 transitions. [2024-11-19 06:51:53,773 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 176 transitions. Word has length 31 [2024-11-19 06:51:53,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:51:53,773 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 176 transitions. [2024-11-19 06:51:53,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 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-19 06:51:53,773 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 176 transitions. [2024-11-19 06:51:53,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 06:51:53,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:51:53,774 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:51:53,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 06:51:53,774 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 06:51:53,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:51:53,775 INFO L85 PathProgramCache]: Analyzing trace with hash 720196155, now seen corresponding path program 1 times [2024-11-19 06:51:53,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:51:53,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240023979] [2024-11-19 06:51:53,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:51:53,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:51:53,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:51:54,048 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-19 06:51:54,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:51:54,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240023979] [2024-11-19 06:51:54,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240023979] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:51:54,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619347045] [2024-11-19 06:51:54,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:51:54,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:51:54,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:51:54,051 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-19 06:51:54,052 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-19 06:51:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:51:54,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-19 06:51:54,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:51:54,379 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-19 06:51:54,379 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:51:54,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619347045] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:51:54,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 06:51:54,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 16 [2024-11-19 06:51:54,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573030618] [2024-11-19 06:51:54,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:51:54,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:51:54,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:51:54,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:51:54,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2024-11-19 06:51:54,382 INFO L87 Difference]: Start difference. First operand 148 states and 176 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 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-19 06:51:54,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:51:54,593 INFO L93 Difference]: Finished difference Result 176 states and 204 transitions. [2024-11-19 06:51:54,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:51:54,594 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 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 31 [2024-11-19 06:51:54,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:51:54,595 INFO L225 Difference]: With dead ends: 176 [2024-11-19 06:51:54,595 INFO L226 Difference]: Without dead ends: 176 [2024-11-19 06:51:54,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2024-11-19 06:51:54,596 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 59 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:51:54,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 301 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:51:54,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-19 06:51:54,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 162. [2024-11-19 06:51:54,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 128 states have (on average 1.5234375) internal successors, (195), 157 states have internal predecessors, (195), 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-19 06:51:54,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 201 transitions. [2024-11-19 06:51:54,600 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 201 transitions. Word has length 31 [2024-11-19 06:51:54,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:51:54,600 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 201 transitions. [2024-11-19 06:51:54,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 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-19 06:51:54,601 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 201 transitions. [2024-11-19 06:51:54,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 06:51:54,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:51:54,601 INFO L215 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, 1, 1, 1] [2024-11-19 06:51:54,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 06:51:54,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:51:54,802 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 06:51:54,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:51:54,803 INFO L85 PathProgramCache]: Analyzing trace with hash -2072663145, now seen corresponding path program 1 times [2024-11-19 06:51:54,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:51:54,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238579632] [2024-11-19 06:51:54,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:51:54,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:51:54,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:51:55,169 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:51:55,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:51:55,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238579632] [2024-11-19 06:51:55,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238579632] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:51:55,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:51:55,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 06:51:55,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541295776] [2024-11-19 06:51:55,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:51:55,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 06:51:55,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:51:55,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 06:51:55,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-19 06:51:55,172 INFO L87 Difference]: Start difference. First operand 162 states and 201 transitions. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:51:55,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:51:55,500 INFO L93 Difference]: Finished difference Result 163 states and 200 transitions. [2024-11-19 06:51:55,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:51:55,501 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2024-11-19 06:51:55,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:51:55,502 INFO L225 Difference]: With dead ends: 163 [2024-11-19 06:51:55,502 INFO L226 Difference]: Without dead ends: 163 [2024-11-19 06:51:55,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-11-19 06:51:55,503 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 27 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:51:55,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 521 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:51:55,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-19 06:51:55,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2024-11-19 06:51:55,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 128 states have (on average 1.515625) internal successors, (194), 157 states have internal predecessors, (194), 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-19 06:51:55,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 200 transitions. [2024-11-19 06:51:55,507 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 200 transitions. Word has length 32 [2024-11-19 06:51:55,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:51:55,508 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 200 transitions. [2024-11-19 06:51:55,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:51:55,508 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 200 transitions. [2024-11-19 06:51:55,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 06:51:55,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:51:55,508 INFO L215 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, 1, 1, 1] [2024-11-19 06:51:55,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 06:51:55,509 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 06:51:55,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:51:55,509 INFO L85 PathProgramCache]: Analyzing trace with hash -2072663144, now seen corresponding path program 1 times [2024-11-19 06:51:55,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:51:55,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591630063] [2024-11-19 06:51:55,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:51:55,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:51:55,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:51:55,938 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:51:55,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:51:55,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591630063] [2024-11-19 06:51:55,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591630063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:51:55,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:51:55,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 06:51:55,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334646808] [2024-11-19 06:51:55,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:51:55,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 06:51:55,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:51:55,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 06:51:55,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-19 06:51:55,941 INFO L87 Difference]: Start difference. First operand 162 states and 200 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:51:56,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:51:56,233 INFO L93 Difference]: Finished difference Result 162 states and 199 transitions. [2024-11-19 06:51:56,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:51:56,233 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2024-11-19 06:51:56,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:51:56,235 INFO L225 Difference]: With dead ends: 162 [2024-11-19 06:51:56,235 INFO L226 Difference]: Without dead ends: 162 [2024-11-19 06:51:56,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-19 06:51:56,236 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 25 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:51:56,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 449 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:51:56,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-19 06:51:56,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2024-11-19 06:51:56,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 128 states have (on average 1.5078125) internal successors, (193), 157 states have internal predecessors, (193), 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-19 06:51:56,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 199 transitions. [2024-11-19 06:51:56,241 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 199 transitions. Word has length 32 [2024-11-19 06:51:56,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:51:56,242 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 199 transitions. [2024-11-19 06:51:56,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:51:56,242 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 199 transitions. [2024-11-19 06:51:56,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 06:51:56,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:51:56,243 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:51:56,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 06:51:56,243 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 06:51:56,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:51:56,243 INFO L85 PathProgramCache]: Analyzing trace with hash 851244369, now seen corresponding path program 1 times [2024-11-19 06:51:56,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:51:56,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309341925] [2024-11-19 06:51:56,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:51:56,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:51:56,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:51:56,539 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-19 06:51:56,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:51:56,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309341925] [2024-11-19 06:51:56,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309341925] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:51:56,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912389197] [2024-11-19 06:51:56,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:51:56,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:51:56,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:51:56,543 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-19 06:51:56,545 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-19 06:51:56,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:51:56,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-19 06:51:56,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:51:56,818 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-19 06:51:56,849 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-19 06:51:57,002 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-19 06:51:57,003 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:51:57,207 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 78 treesize of output 74 [2024-11-19 06:51:57,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:51:57,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912389197] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 06:51:57,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:51:57,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 12] total 26 [2024-11-19 06:51:57,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735279765] [2024-11-19 06:51:57,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:51:57,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 06:51:57,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:51:57,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 06:51:57,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2024-11-19 06:51:57,307 INFO L87 Difference]: Start difference. First operand 162 states and 199 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 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-19 06:51:57,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:51:57,548 INFO L93 Difference]: Finished difference Result 173 states and 201 transitions. [2024-11-19 06:51:57,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:51:57,549 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 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-19 06:51:57,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:51:57,550 INFO L225 Difference]: With dead ends: 173 [2024-11-19 06:51:57,550 INFO L226 Difference]: Without dead ends: 173 [2024-11-19 06:51:57,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=719, Unknown=0, NotChecked=0, Total=812 [2024-11-19 06:51:57,551 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 42 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:51:57,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 472 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:51:57,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-19 06:51:57,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 162. [2024-11-19 06:51:57,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 128 states have (on average 1.5) internal successors, (192), 157 states have internal predecessors, (192), 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-19 06:51:57,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 198 transitions. [2024-11-19 06:51:57,558 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 198 transitions. Word has length 32 [2024-11-19 06:51:57,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:51:57,558 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 198 transitions. [2024-11-19 06:51:57,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 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-19 06:51:57,558 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 198 transitions. [2024-11-19 06:51:57,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-19 06:51:57,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:51:57,559 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:51:57,577 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-19 06:51:57,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:51:57,760 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 06:51:57,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:51:57,761 INFO L85 PathProgramCache]: Analyzing trace with hash 618771802, now seen corresponding path program 1 times [2024-11-19 06:51:57,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:51:57,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061005170] [2024-11-19 06:51:57,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:51:57,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:51:57,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:51:58,031 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-19 06:51:58,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:51:58,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061005170] [2024-11-19 06:51:58,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061005170] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:51:58,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244418198] [2024-11-19 06:51:58,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:51:58,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:51:58,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:51:58,034 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-19 06:51:58,035 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-19 06:51:58,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:51:58,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-19 06:51:58,204 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:51:58,316 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-19 06:51:58,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-19 06:51:58,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-19 06:51:58,481 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-19 06:51:58,481 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:51:58,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244418198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:51:58,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 06:51:58,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2024-11-19 06:51:58,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104902796] [2024-11-19 06:51:58,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:51:58,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 06:51:58,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:51:58,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 06:51:58,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2024-11-19 06:51:58,483 INFO L87 Difference]: Start difference. First operand 162 states and 198 transitions. Second operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 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-19 06:51:58,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:51:58,782 INFO L93 Difference]: Finished difference Result 172 states and 200 transitions. [2024-11-19 06:51:58,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 06:51:58,783 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 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 33 [2024-11-19 06:51:58,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:51:58,784 INFO L225 Difference]: With dead ends: 172 [2024-11-19 06:51:58,784 INFO L226 Difference]: Without dead ends: 172 [2024-11-19 06:51:58,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2024-11-19 06:51:58,785 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 41 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:51:58,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 496 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:51:58,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-19 06:51:58,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 162. [2024-11-19 06:51:58,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 128 states have (on average 1.4921875) internal successors, (191), 157 states have internal predecessors, (191), 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-19 06:51:58,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 197 transitions. [2024-11-19 06:51:58,788 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 197 transitions. Word has length 33 [2024-11-19 06:51:58,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:51:58,788 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 197 transitions. [2024-11-19 06:51:58,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 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-19 06:51:58,789 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 197 transitions. [2024-11-19 06:51:58,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-19 06:51:58,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:51:58,789 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:51:58,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-19 06:51:58,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:51:58,994 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 06:51:58,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:51:58,994 INFO L85 PathProgramCache]: Analyzing trace with hash 619393825, now seen corresponding path program 1 times [2024-11-19 06:51:58,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:51:58,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051594860] [2024-11-19 06:51:58,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:51:58,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:51:59,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:51:59,092 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-19 06:51:59,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:51:59,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051594860] [2024-11-19 06:51:59,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051594860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:51:59,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:51:59,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 06:51:59,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472124074] [2024-11-19 06:51:59,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:51:59,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 06:51:59,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:51:59,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 06:51:59,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:51:59,095 INFO L87 Difference]: Start difference. First operand 162 states and 197 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 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-19 06:51:59,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:51:59,184 INFO L93 Difference]: Finished difference Result 165 states and 196 transitions. [2024-11-19 06:51:59,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:51:59,184 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 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 33 [2024-11-19 06:51:59,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:51:59,185 INFO L225 Difference]: With dead ends: 165 [2024-11-19 06:51:59,185 INFO L226 Difference]: Without dead ends: 165 [2024-11-19 06:51:59,186 INFO L431 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-19 06:51:59,186 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 50 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:51:59,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 508 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:51:59,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-19 06:51:59,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 159. [2024-11-19 06:51:59,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 125 states have (on average 1.448) internal successors, (181), 154 states have internal predecessors, (181), 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-19 06:51:59,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 187 transitions. [2024-11-19 06:51:59,191 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 187 transitions. Word has length 33 [2024-11-19 06:51:59,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:51:59,191 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 187 transitions. [2024-11-19 06:51:59,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 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-19 06:51:59,191 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 187 transitions. [2024-11-19 06:51:59,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-19 06:51:59,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:51:59,192 INFO L215 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, 1, 1, 1, 1] [2024-11-19 06:51:59,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-19 06:51:59,192 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 06:51:59,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:51:59,193 INFO L85 PathProgramCache]: Analyzing trace with hash 660763147, now seen corresponding path program 1 times [2024-11-19 06:51:59,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:51:59,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768528377] [2024-11-19 06:51:59,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:51:59,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:51:59,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:52:00,129 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:52:00,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:52:00,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768528377] [2024-11-19 06:52:00,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768528377] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:52:00,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133543258] [2024-11-19 06:52:00,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:52:00,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:52:00,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:52:00,132 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-19 06:52:00,133 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-19 06:52:00,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:52:00,307 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-11-19 06:52:00,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:52:00,318 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-19 06:52:00,354 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-19 06:52:00,360 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-19 06:52:00,376 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-19 06:52:00,384 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-19 06:52:00,562 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-19 06:52:00,563 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 17 treesize of output 21 [2024-11-19 06:52:00,644 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-19 06:52:00,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-19 06:52:00,747 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-19 06:52:00,748 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 16 treesize of output 18 [2024-11-19 06:52:00,816 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-19 06:52:00,821 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-19 06:52:00,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:52:00,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:52:00,892 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-19 06:52:00,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:52:00,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:52:00,906 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-19 06:52:00,947 INFO L349 Elim1Store]: treesize reduction 40, result has 40.3 percent of original size [2024-11-19 06:52:00,948 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 33 [2024-11-19 06:52:00,981 INFO L349 Elim1Store]: treesize reduction 40, result has 40.3 percent of original size [2024-11-19 06:52:00,981 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 33 [2024-11-19 06:52:01,322 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:52:01,323 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:52:02,783 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:52:02,783 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 30 treesize of output 36 [2024-11-19 06:52:02,789 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:52:02,793 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:52:02,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 70 [2024-11-19 06:52:02,803 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-19 06:52:02,809 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 24 treesize of output 20 [2024-11-19 06:52:02,891 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:52:02,891 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 30 treesize of output 36 [2024-11-19 06:52:02,896 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:52:02,902 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:52:02,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 70 [2024-11-19 06:52:02,910 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 28 treesize of output 24 [2024-11-19 06:52:02,915 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 50 treesize of output 42 [2024-11-19 06:52:03,078 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:52:03,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133543258] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:52:03,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:52:03,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 18] total 41 [2024-11-19 06:52:03,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553473833] [2024-11-19 06:52:03,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:52:03,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-19 06:52:03,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:52:03,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-19 06:52:03,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1485, Unknown=9, NotChecked=0, Total=1640 [2024-11-19 06:52:03,081 INFO L87 Difference]: Start difference. First operand 159 states and 187 transitions. Second operand has 41 states, 41 states have (on average 1.829268292682927) internal successors, (75), 38 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 06:52:04,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:52:04,173 INFO L93 Difference]: Finished difference Result 154 states and 179 transitions. [2024-11-19 06:52:04,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 06:52:04,174 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.829268292682927) internal successors, (75), 38 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2024-11-19 06:52:04,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:52:04,175 INFO L225 Difference]: With dead ends: 154 [2024-11-19 06:52:04,175 INFO L226 Difference]: Without dead ends: 154 [2024-11-19 06:52:04,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=202, Invalid=1951, Unknown=9, NotChecked=0, Total=2162 [2024-11-19 06:52:04,176 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 45 mSDsluCounter, 1274 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1349 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 06:52:04,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 1349 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 886 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 06:52:04,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-19 06:52:04,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2024-11-19 06:52:04,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 120 states have (on average 1.4416666666666667) internal successors, (173), 149 states have internal predecessors, (173), 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-19 06:52:04,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 179 transitions. [2024-11-19 06:52:04,180 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 179 transitions. Word has length 33 [2024-11-19 06:52:04,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:52:04,180 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 179 transitions. [2024-11-19 06:52:04,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.829268292682927) internal successors, (75), 38 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 06:52:04,180 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 179 transitions. [2024-11-19 06:52:04,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 06:52:04,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:52:04,181 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:52:04,198 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-19 06:52:04,382 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,SelfDestructingSolverStorable24 [2024-11-19 06:52:04,383 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 06:52:04,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:52:04,383 INFO L85 PathProgramCache]: Analyzing trace with hash 2002056819, now seen corresponding path program 1 times [2024-11-19 06:52:04,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:52:04,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840398727] [2024-11-19 06:52:04,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:52:04,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:52:04,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:52:04,744 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-19 06:52:04,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:52:04,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840398727] [2024-11-19 06:52:04,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840398727] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:52:04,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262401124] [2024-11-19 06:52:04,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:52:04,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:52:04,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:52:04,747 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-19 06:52:04,749 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-19 06:52:04,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:52:04,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-19 06:52:04,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:52:04,950 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-19 06:52:04,989 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-19 06:52:04,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-19 06:52:05,033 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-19 06:52:05,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-19 06:52:05,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-19 06:52:05,207 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-19 06:52:05,207 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:52:09,411 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 86 treesize of output 82 [2024-11-19 06:52:09,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:52:09,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262401124] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 06:52:09,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:52:09,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 12] total 27 [2024-11-19 06:52:09,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444045610] [2024-11-19 06:52:09,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:52:09,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 06:52:09,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:52:09,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 06:52:09,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=668, Unknown=1, NotChecked=0, Total=756 [2024-11-19 06:52:09,831 INFO L87 Difference]: Start difference. First operand 154 states and 179 transitions. Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 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-19 06:52:11,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-19 06:52:11,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:52:11,505 INFO L93 Difference]: Finished difference Result 154 states and 178 transitions. [2024-11-19 06:52:11,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:52:11,505 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 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 34 [2024-11-19 06:52:11,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:52:11,506 INFO L225 Difference]: With dead ends: 154 [2024-11-19 06:52:11,506 INFO L226 Difference]: Without dead ends: 154 [2024-11-19 06:52:11,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=96, Invalid=773, Unknown=1, NotChecked=0, Total=870 [2024-11-19 06:52:11,507 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 13 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-19 06:52:11,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 377 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-19 06:52:11,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-19 06:52:11,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2024-11-19 06:52:11,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 120 states have (on average 1.4333333333333333) internal successors, (172), 149 states have internal predecessors, (172), 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-19 06:52:11,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 178 transitions. [2024-11-19 06:52:11,512 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 178 transitions. Word has length 34 [2024-11-19 06:52:11,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:52:11,512 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 178 transitions. [2024-11-19 06:52:11,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 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-19 06:52:11,512 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 178 transitions. [2024-11-19 06:52:11,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 06:52:11,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:52:11,513 INFO L215 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, 1, 1, 1, 1, 1, 1] [2024-11-19 06:52:11,530 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-19 06:52:11,717 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,SelfDestructingSolverStorable25 [2024-11-19 06:52:11,718 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 06:52:11,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:52:11,718 INFO L85 PathProgramCache]: Analyzing trace with hash 2037087750, now seen corresponding path program 1 times [2024-11-19 06:52:11,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:52:11,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84043978] [2024-11-19 06:52:11,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:52:11,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:52:11,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:52:12,048 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:52:12,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:52:12,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84043978] [2024-11-19 06:52:12,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84043978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:52:12,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:52:12,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 06:52:12,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117113490] [2024-11-19 06:52:12,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:52:12,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 06:52:12,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:52:12,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 06:52:12,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-19 06:52:12,050 INFO L87 Difference]: Start difference. First operand 154 states and 178 transitions. Second operand has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:52:12,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:52:12,471 INFO L93 Difference]: Finished difference Result 155 states and 177 transitions. [2024-11-19 06:52:12,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 06:52:12,471 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2024-11-19 06:52:12,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:52:12,472 INFO L225 Difference]: With dead ends: 155 [2024-11-19 06:52:12,472 INFO L226 Difference]: Without dead ends: 155 [2024-11-19 06:52:12,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-11-19 06:52:12,473 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 30 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:52:12,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 549 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:52:12,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-19 06:52:12,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2024-11-19 06:52:12,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 120 states have (on average 1.425) internal successors, (171), 149 states have internal predecessors, (171), 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-19 06:52:12,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 177 transitions. [2024-11-19 06:52:12,476 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 177 transitions. Word has length 35 [2024-11-19 06:52:12,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:52:12,476 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 177 transitions. [2024-11-19 06:52:12,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:52:12,477 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 177 transitions. [2024-11-19 06:52:12,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 06:52:12,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:52:12,477 INFO L215 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, 1, 1, 1, 1, 1, 1] [2024-11-19 06:52:12,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-19 06:52:12,477 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 06:52:12,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:52:12,478 INFO L85 PathProgramCache]: Analyzing trace with hash 2037087751, now seen corresponding path program 1 times [2024-11-19 06:52:12,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:52:12,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280371571] [2024-11-19 06:52:12,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:52:12,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:52:12,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:52:12,963 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:52:12,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:52:12,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280371571] [2024-11-19 06:52:12,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280371571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:52:12,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:52:12,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 06:52:12,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503852231] [2024-11-19 06:52:12,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:52:12,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 06:52:12,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:52:12,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 06:52:12,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-19 06:52:12,965 INFO L87 Difference]: Start difference. First operand 154 states and 177 transitions. Second operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:52:13,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:52:13,229 INFO L93 Difference]: Finished difference Result 154 states and 176 transitions. [2024-11-19 06:52:13,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 06:52:13,229 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2024-11-19 06:52:13,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:52:13,230 INFO L225 Difference]: With dead ends: 154 [2024-11-19 06:52:13,230 INFO L226 Difference]: Without dead ends: 154 [2024-11-19 06:52:13,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-11-19 06:52:13,231 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 29 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:52:13,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 396 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:52:13,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-19 06:52:13,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2024-11-19 06:52:13,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 120 states have (on average 1.4166666666666667) internal successors, (170), 149 states have internal predecessors, (170), 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-19 06:52:13,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 176 transitions. [2024-11-19 06:52:13,235 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 176 transitions. Word has length 35 [2024-11-19 06:52:13,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:52:13,235 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 176 transitions. [2024-11-19 06:52:13,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:52:13,235 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 176 transitions. [2024-11-19 06:52:13,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 06:52:13,236 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:52:13,236 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:52:13,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-19 06:52:13,236 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 06:52:13,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:52:13,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1934219389, now seen corresponding path program 1 times [2024-11-19 06:52:13,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:52:13,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977279366] [2024-11-19 06:52:13,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:52:13,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:52:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:52:13,635 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-19 06:52:13,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:52:13,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977279366] [2024-11-19 06:52:13,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977279366] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:52:13,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033352276] [2024-11-19 06:52:13,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:52:13,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:52:13,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:52:13,638 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-19 06:52:13,640 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-19 06:52:13,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:52:13,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-19 06:52:13,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:52:13,806 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-19 06:52:13,826 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:52:13,827 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-19 06:52:13,864 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 15 treesize of output 1 [2024-11-19 06:52:13,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-19 06:52:13,977 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 16 treesize of output 8 [2024-11-19 06:52:13,989 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-19 06:52:13,990 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-19 06:52:13,990 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:52:13,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033352276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:52:13,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 06:52:13,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [13] total 18 [2024-11-19 06:52:13,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354938154] [2024-11-19 06:52:13,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:52:13,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 06:52:13,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:52:13,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 06:52:13,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2024-11-19 06:52:13,993 INFO L87 Difference]: Start difference. First operand 154 states and 176 transitions. Second operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 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-19 06:52:14,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:52:14,310 INFO L93 Difference]: Finished difference Result 159 states and 178 transitions. [2024-11-19 06:52:14,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 06:52:14,311 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 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-19 06:52:14,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:52:14,312 INFO L225 Difference]: With dead ends: 159 [2024-11-19 06:52:14,312 INFO L226 Difference]: Without dead ends: 159 [2024-11-19 06:52:14,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2024-11-19 06:52:14,313 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 57 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:52:14,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 456 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:52:14,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-19 06:52:14,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 154. [2024-11-19 06:52:14,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 120 states have (on average 1.4083333333333334) internal successors, (169), 149 states have internal predecessors, (169), 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-19 06:52:14,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 175 transitions. [2024-11-19 06:52:14,316 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 175 transitions. Word has length 35 [2024-11-19 06:52:14,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:52:14,316 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 175 transitions. [2024-11-19 06:52:14,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 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-19 06:52:14,317 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 175 transitions. [2024-11-19 06:52:14,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 06:52:14,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:52:14,317 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:52:14,335 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-19 06:52:14,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:52:14,522 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 06:52:14,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:52:14,522 INFO L85 PathProgramCache]: Analyzing trace with hash -168741001, now seen corresponding path program 1 times [2024-11-19 06:52:14,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:52:14,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646351265] [2024-11-19 06:52:14,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:52:14,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:52:14,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:52:14,837 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-19 06:52:14,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:52:14,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646351265] [2024-11-19 06:52:14,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646351265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:52:14,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:52:14,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 06:52:14,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642036357] [2024-11-19 06:52:14,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:52:14,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 06:52:14,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:52:14,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 06:52:14,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-19 06:52:14,839 INFO L87 Difference]: Start difference. First operand 154 states and 175 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 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-19 06:52:15,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:52:15,102 INFO L93 Difference]: Finished difference Result 158 states and 176 transitions. [2024-11-19 06:52:15,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 06:52:15,103 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 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 36 [2024-11-19 06:52:15,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:52:15,103 INFO L225 Difference]: With dead ends: 158 [2024-11-19 06:52:15,103 INFO L226 Difference]: Without dead ends: 158 [2024-11-19 06:52:15,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-19 06:52:15,104 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 25 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:52:15,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 651 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:52:15,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-19 06:52:15,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2024-11-19 06:52:15,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 122 states have (on average 1.3934426229508197) internal successors, (170), 151 states have internal predecessors, (170), 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-19 06:52:15,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 176 transitions. [2024-11-19 06:52:15,108 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 176 transitions. Word has length 36 [2024-11-19 06:52:15,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:52:15,109 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 176 transitions. [2024-11-19 06:52:15,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 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-19 06:52:15,109 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 176 transitions. [2024-11-19 06:52:15,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-19 06:52:15,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:52:15,109 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:52:15,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-19 06:52:15,110 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 06:52:15,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:52:15,111 INFO L85 PathProgramCache]: Analyzing trace with hash -936003587, now seen corresponding path program 1 times [2024-11-19 06:52:15,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:52:15,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928103168] [2024-11-19 06:52:15,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:52:15,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:52:15,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:52:15,435 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-19 06:52:15,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:52:15,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928103168] [2024-11-19 06:52:15,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928103168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:52:15,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:52:15,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 06:52:15,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961124150] [2024-11-19 06:52:15,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:52:15,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 06:52:15,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:52:15,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 06:52:15,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-19 06:52:15,436 INFO L87 Difference]: Start difference. First operand 156 states and 176 transitions. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:52:15,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:52:15,658 INFO L93 Difference]: Finished difference Result 157 states and 175 transitions. [2024-11-19 06:52:15,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 06:52:15,658 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2024-11-19 06:52:15,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:52:15,659 INFO L225 Difference]: With dead ends: 157 [2024-11-19 06:52:15,659 INFO L226 Difference]: Without dead ends: 157 [2024-11-19 06:52:15,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-19 06:52:15,660 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 40 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:52:15,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 531 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:52:15,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-19 06:52:15,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2024-11-19 06:52:15,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 122 states have (on average 1.3852459016393444) internal successors, (169), 151 states have internal predecessors, (169), 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-19 06:52:15,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 175 transitions. [2024-11-19 06:52:15,667 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 175 transitions. Word has length 37 [2024-11-19 06:52:15,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:52:15,667 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 175 transitions. [2024-11-19 06:52:15,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:52:15,667 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 175 transitions. [2024-11-19 06:52:15,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-19 06:52:15,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:52:15,668 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:52:15,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-19 06:52:15,668 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 06:52:15,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:52:15,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1048660025, now seen corresponding path program 1 times [2024-11-19 06:52:15,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:52:15,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928145281] [2024-11-19 06:52:15,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:52:15,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:52:15,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:52:16,207 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-19 06:52:16,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:52:16,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928145281] [2024-11-19 06:52:16,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928145281] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:52:16,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538075512] [2024-11-19 06:52:16,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:52:16,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:52:16,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:52:16,209 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-19 06:52:16,210 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-19 06:52:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:52:16,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-19 06:52:16,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:52:16,447 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-19 06:52:16,503 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-19 06:52:16,503 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 17 treesize of output 21 [2024-11-19 06:52:16,582 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 15 treesize of output 1 [2024-11-19 06:52:16,644 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 43 treesize of output 23 [2024-11-19 06:52:16,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 16 [2024-11-19 06:52:16,986 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:52:16,986 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 29 treesize of output 13 [2024-11-19 06:52:16,990 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-19 06:52:16,991 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:52:16,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538075512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:52:16,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 06:52:16,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [16] total 27 [2024-11-19 06:52:16,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087690559] [2024-11-19 06:52:16,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:52:16,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 06:52:16,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:52:16,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 06:52:16,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=688, Unknown=0, NotChecked=0, Total=756 [2024-11-19 06:52:16,992 INFO L87 Difference]: Start difference. First operand 156 states and 175 transitions. Second operand has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 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-19 06:52:17,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:52:17,467 INFO L93 Difference]: Finished difference Result 156 states and 174 transitions. [2024-11-19 06:52:17,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 06:52:17,467 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 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 38 [2024-11-19 06:52:17,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:52:17,468 INFO L225 Difference]: With dead ends: 156 [2024-11-19 06:52:17,468 INFO L226 Difference]: Without dead ends: 156 [2024-11-19 06:52:17,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=85, Invalid=845, Unknown=0, NotChecked=0, Total=930 [2024-11-19 06:52:17,469 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 12 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:52:17,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 672 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:52:17,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-19 06:52:17,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2024-11-19 06:52:17,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 122 states have (on average 1.3770491803278688) internal successors, (168), 151 states have internal predecessors, (168), 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-19 06:52:17,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 174 transitions. [2024-11-19 06:52:17,473 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 174 transitions. Word has length 38 [2024-11-19 06:52:17,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:52:17,473 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 174 transitions. [2024-11-19 06:52:17,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 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-19 06:52:17,473 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 174 transitions. [2024-11-19 06:52:17,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-19 06:52:17,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:52:17,474 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:52:17,492 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-19 06:52:17,678 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,SelfDestructingSolverStorable31 [2024-11-19 06:52:17,679 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 06:52:17,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:52:17,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1555025380, now seen corresponding path program 1 times [2024-11-19 06:52:17,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:52:17,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832476364] [2024-11-19 06:52:17,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:52:17,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:52:17,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:52:18,140 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-19 06:52:18,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:52:18,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832476364] [2024-11-19 06:52:18,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832476364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:52:18,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:52:18,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-19 06:52:18,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408503635] [2024-11-19 06:52:18,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:52:18,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 06:52:18,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:52:18,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 06:52:18,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-11-19 06:52:18,141 INFO L87 Difference]: Start difference. First operand 156 states and 174 transitions. Second operand has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 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-19 06:52:18,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:52:18,388 INFO L93 Difference]: Finished difference Result 156 states and 173 transitions. [2024-11-19 06:52:18,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 06:52:18,388 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 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 40 [2024-11-19 06:52:18,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:52:18,389 INFO L225 Difference]: With dead ends: 156 [2024-11-19 06:52:18,389 INFO L226 Difference]: Without dead ends: 156 [2024-11-19 06:52:18,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2024-11-19 06:52:18,390 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 47 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:52:18,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 562 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:52:18,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-19 06:52:18,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2024-11-19 06:52:18,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 122 states have (on average 1.3688524590163935) internal successors, (167), 151 states have internal predecessors, (167), 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-19 06:52:18,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 173 transitions. [2024-11-19 06:52:18,393 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 173 transitions. Word has length 40 [2024-11-19 06:52:18,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:52:18,393 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 173 transitions. [2024-11-19 06:52:18,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 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-19 06:52:18,394 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 173 transitions. [2024-11-19 06:52:18,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-19 06:52:18,394 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:52:18,394 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:52:18,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-19 06:52:18,394 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 06:52:18,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:52:18,394 INFO L85 PathProgramCache]: Analyzing trace with hash -243736595, now seen corresponding path program 1 times [2024-11-19 06:52:18,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:52:18,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271726198] [2024-11-19 06:52:18,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:52:18,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:52:18,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:52:18,516 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-19 06:52:18,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:52:18,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271726198] [2024-11-19 06:52:18,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271726198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:52:18,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:52:18,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 06:52:18,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590802715] [2024-11-19 06:52:18,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:52:18,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 06:52:18,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:52:18,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 06:52:18,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:52:18,519 INFO L87 Difference]: Start difference. First operand 156 states and 173 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 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-19 06:52:18,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:52:18,665 INFO L93 Difference]: Finished difference Result 161 states and 180 transitions. [2024-11-19 06:52:18,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:52:18,666 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 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 43 [2024-11-19 06:52:18,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:52:18,667 INFO L225 Difference]: With dead ends: 161 [2024-11-19 06:52:18,667 INFO L226 Difference]: Without dead ends: 161 [2024-11-19 06:52:18,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 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-19 06:52:18,668 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 37 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:52:18,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 455 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:52:18,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-19 06:52:18,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2024-11-19 06:52:18,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 126 states have (on average 1.380952380952381) internal successors, (174), 155 states have internal predecessors, (174), 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-19 06:52:18,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 180 transitions. [2024-11-19 06:52:18,673 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 180 transitions. Word has length 43 [2024-11-19 06:52:18,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:52:18,673 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 180 transitions. [2024-11-19 06:52:18,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 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-19 06:52:18,674 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 180 transitions. [2024-11-19 06:52:18,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-19 06:52:18,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:52:18,674 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:52:18,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-19 06:52:18,675 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 06:52:18,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:52:18,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1612656581, now seen corresponding path program 1 times [2024-11-19 06:52:18,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:52:18,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996360143] [2024-11-19 06:52:18,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:52:18,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:52:18,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:52:18,930 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-19 06:52:18,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:52:18,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996360143] [2024-11-19 06:52:18,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996360143] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:52:18,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995270310] [2024-11-19 06:52:18,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:52:18,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:52:18,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:52:18,934 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-19 06:52:18,936 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-19 06:52:19,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:52:19,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-19 06:52:19,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:52:19,337 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-19 06:52:19,337 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:52:19,465 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:52:19,465 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-19 06:52:19,570 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-19 06:52:19,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995270310] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:52:19,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:52:19,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 19 [2024-11-19 06:52:19,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080222970] [2024-11-19 06:52:19,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:52:19,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-19 06:52:19,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:52:19,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-19 06:52:19,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2024-11-19 06:52:19,572 INFO L87 Difference]: Start difference. First operand 160 states and 180 transitions. Second operand has 20 states, 19 states have (on average 5.052631578947368) internal successors, (96), 19 states have internal predecessors, (96), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-19 06:52:19,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:52:19,782 INFO L93 Difference]: Finished difference Result 163 states and 179 transitions. [2024-11-19 06:52:19,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 06:52:19,783 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 5.052631578947368) internal successors, (96), 19 states have internal predecessors, (96), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 44 [2024-11-19 06:52:19,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:52:19,784 INFO L225 Difference]: With dead ends: 163 [2024-11-19 06:52:19,784 INFO L226 Difference]: Without dead ends: 163 [2024-11-19 06:52:19,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2024-11-19 06:52:19,785 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 44 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:52:19,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 662 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:52:19,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-19 06:52:19,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 160. [2024-11-19 06:52:19,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 126 states have (on average 1.3571428571428572) internal successors, (171), 155 states have internal predecessors, (171), 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-19 06:52:19,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 177 transitions. [2024-11-19 06:52:19,788 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 177 transitions. Word has length 44 [2024-11-19 06:52:19,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:52:19,789 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 177 transitions. [2024-11-19 06:52:19,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 5.052631578947368) internal successors, (96), 19 states have internal predecessors, (96), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-19 06:52:19,789 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 177 transitions. [2024-11-19 06:52:19,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-19 06:52:19,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:52:19,789 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:52:19,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-19 06:52:19,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-11-19 06:52:19,990 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 06:52:19,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:52:19,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1547253515, now seen corresponding path program 1 times [2024-11-19 06:52:19,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:52:19,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915945297] [2024-11-19 06:52:19,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:52:19,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:52:20,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:52:20,404 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:52:20,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:52:20,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915945297] [2024-11-19 06:52:20,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915945297] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:52:20,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617848271] [2024-11-19 06:52:20,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:52:20,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:52:20,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:52:20,407 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-19 06:52:20,409 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-19 06:52:20,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:52:20,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-19 06:52:20,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:52:20,809 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-19 06:52:20,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-19 06:52:20,821 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:52:20,822 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-19 06:52:20,853 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-19 06:52:20,902 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 10 treesize of output 4 [2024-11-19 06:52:21,007 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:52:21,007 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:52:21,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617848271] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:52:21,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:52:21,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2024-11-19 06:52:21,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54706762] [2024-11-19 06:52:21,224 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:52:21,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-19 06:52:21,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:52:21,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-19 06:52:21,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=763, Unknown=0, NotChecked=0, Total=870 [2024-11-19 06:52:21,225 INFO L87 Difference]: Start difference. First operand 160 states and 177 transitions. Second operand has 25 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 22 states have internal predecessors, (77), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:52:21,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:52:21,599 INFO L93 Difference]: Finished difference Result 168 states and 181 transitions. [2024-11-19 06:52:21,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 06:52:21,600 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 22 states have internal predecessors, (77), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 45 [2024-11-19 06:52:21,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:52:21,600 INFO L225 Difference]: With dead ends: 168 [2024-11-19 06:52:21,601 INFO L226 Difference]: Without dead ends: 168 [2024-11-19 06:52:21,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=140, Invalid=982, Unknown=0, NotChecked=0, Total=1122 [2024-11-19 06:52:21,601 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 71 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:52:21,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 816 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:52:21,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-19 06:52:21,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 160. [2024-11-19 06:52:21,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 126 states have (on average 1.3333333333333333) internal successors, (168), 155 states have internal predecessors, (168), 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-19 06:52:21,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 174 transitions. [2024-11-19 06:52:21,606 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 174 transitions. Word has length 45 [2024-11-19 06:52:21,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:52:21,606 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 174 transitions. [2024-11-19 06:52:21,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 22 states have internal predecessors, (77), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:52:21,607 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 174 transitions. [2024-11-19 06:52:21,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-19 06:52:21,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:52:21,607 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:52:21,622 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-19 06:52:21,811 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,SelfDestructingSolverStorable35 [2024-11-19 06:52:21,812 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 06:52:21,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:52:21,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1632965377, now seen corresponding path program 1 times [2024-11-19 06:52:21,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:52:21,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777911004] [2024-11-19 06:52:21,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:52:21,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:52:21,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:52:22,763 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-19 06:52:22,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:52:22,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777911004] [2024-11-19 06:52:22,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777911004] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:52:22,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417790648] [2024-11-19 06:52:22,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:52:22,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:52:22,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:52:22,766 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-19 06:52:22,767 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-19 06:52:22,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:52:23,000 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 82 conjuncts are in the unsatisfiable core [2024-11-19 06:52:23,005 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:52:23,012 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-19 06:52:23,043 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-19 06:52:23,052 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-19 06:52:23,066 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-19 06:52:23,074 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-19 06:52:23,213 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-19 06:52:23,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-19 06:52:23,277 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-19 06:52:23,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 20 [2024-11-19 06:52:23,301 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-19 06:52:23,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 20 [2024-11-19 06:52:23,387 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-19 06:52:23,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-11-19 06:52:23,474 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 28 treesize of output 21 [2024-11-19 06:52:23,478 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 28 treesize of output 21 [2024-11-19 06:52:23,572 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 39 treesize of output 30 [2024-11-19 06:52:23,583 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 39 treesize of output 30 [2024-11-19 06:52:23,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 52 [2024-11-19 06:52:23,655 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 39 treesize of output 30 [2024-11-19 06:52:24,124 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 10 treesize of output 9 [2024-11-19 06:52:24,181 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-19 06:52:24,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-19 06:52:24,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:52:24,334 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:52:24,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 64 treesize of output 78 [2024-11-19 06:52:24,353 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:52:24,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 31 [2024-11-19 06:52:24,506 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-19 06:52:24,506 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:52:24,687 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 10 treesize of output 8 [2024-11-19 06:52:26,943 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:52:26,943 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 36 treesize of output 42 [2024-11-19 06:52:26,949 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 198 treesize of output 190 [2024-11-19 06:52:26,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:52:26,967 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 155 treesize of output 161 [2024-11-19 06:52:26,980 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:52:26,980 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 36 treesize of output 42 [2024-11-19 06:52:26,988 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 158 treesize of output 154 [2024-11-19 06:52:26,998 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 104 treesize of output 98 [2024-11-19 06:52:27,025 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:52:27,025 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 97 treesize of output 107 [2024-11-19 06:52:27,041 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 79 treesize of output 77 [2024-11-19 06:52:27,051 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 297 treesize of output 289 [2024-11-19 06:52:27,065 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 118 treesize of output 114 [2024-11-19 06:52:27,372 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:52:27,372 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 2 case distinctions, treesize of input 73 treesize of output 63 [2024-11-19 06:52:27,375 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 187 treesize of output 179 [2024-11-19 06:52:27,384 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 0 case distinctions, treesize of input 159 treesize of output 155 [2024-11-19 06:52:27,417 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:52:27,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 235 treesize of output 259 [2024-11-19 06:52:27,445 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 0 case distinctions, treesize of input 612 treesize of output 596 [2024-11-19 06:52:27,993 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-19 06:52:27,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417790648] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:52:27,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:52:27,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 23, 23] total 55 [2024-11-19 06:52:27,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826747607] [2024-11-19 06:52:27,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:52:27,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-11-19 06:52:27,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:52:27,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-11-19 06:52:27,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=2735, Unknown=44, NotChecked=0, Total=2970 [2024-11-19 06:52:27,996 INFO L87 Difference]: Start difference. First operand 160 states and 174 transitions. Second operand has 55 states, 55 states have (on average 2.1818181818181817) internal successors, (120), 52 states have internal predecessors, (120), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 06:52:29,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:52:29,757 INFO L93 Difference]: Finished difference Result 163 states and 177 transitions. [2024-11-19 06:52:29,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 06:52:29,757 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 2.1818181818181817) internal successors, (120), 52 states have internal predecessors, (120), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2024-11-19 06:52:29,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:52:29,758 INFO L225 Difference]: With dead ends: 163 [2024-11-19 06:52:29,758 INFO L226 Difference]: Without dead ends: 163 [2024-11-19 06:52:29,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 881 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=317, Invalid=3929, Unknown=44, NotChecked=0, Total=4290 [2024-11-19 06:52:29,759 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 55 mSDsluCounter, 1694 mSDsCounter, 0 mSdLazyCounter, 1594 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 1758 SdHoareTripleChecker+Invalid, 1628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:52:29,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 1758 Invalid, 1628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1594 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-19 06:52:29,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-19 06:52:29,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2024-11-19 06:52:29,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 129 states have (on average 1.3255813953488371) internal successors, (171), 158 states have internal predecessors, (171), 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-19 06:52:29,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 177 transitions. [2024-11-19 06:52:29,763 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 177 transitions. Word has length 46 [2024-11-19 06:52:29,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:52:29,763 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 177 transitions. [2024-11-19 06:52:29,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 2.1818181818181817) internal successors, (120), 52 states have internal predecessors, (120), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 06:52:29,764 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 177 transitions. [2024-11-19 06:52:29,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-19 06:52:29,764 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:52:29,764 INFO L215 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, 1, 1, 1, 1, 1, 1] [2024-11-19 06:52:29,781 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-19 06:52:29,968 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,SelfDestructingSolverStorable36 [2024-11-19 06:52:29,969 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 06:52:29,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:52:29,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1010718077, now seen corresponding path program 1 times [2024-11-19 06:52:29,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:52:29,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674456935] [2024-11-19 06:52:29,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:52:29,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:52:29,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:52:30,585 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 06:52:30,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:52:30,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674456935] [2024-11-19 06:52:30,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674456935] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:52:30,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071961890] [2024-11-19 06:52:30,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:52:30,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:52:30,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:52:30,588 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-19 06:52:30,590 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-19 06:52:30,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:52:30,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-19 06:52:30,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:52:30,830 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:52:30,831 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-19 06:52:30,847 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-19 06:52:30,891 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 06:52:30,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-19 06:52:30,927 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 06:52:30,928 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-19 06:52:30,966 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 06:52:30,967 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-19 06:52:30,980 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-19 06:52:30,993 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-19 06:52:31,018 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-19 06:52:31,018 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-19 06:52:31,020 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-19 06:52:31,020 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:52:31,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071961890] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:52:31,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:52:31,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 23 [2024-11-19 06:52:31,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126435497] [2024-11-19 06:52:31,060 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:52:31,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-19 06:52:31,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:52:31,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-19 06:52:31,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=482, Unknown=1, NotChecked=44, Total=600 [2024-11-19 06:52:31,061 INFO L87 Difference]: Start difference. First operand 163 states and 177 transitions. Second operand has 24 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 21 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 06:52:31,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:52:31,418 INFO L93 Difference]: Finished difference Result 160 states and 174 transitions. [2024-11-19 06:52:31,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 06:52:31,419 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 21 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 48 [2024-11-19 06:52:31,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:52:31,420 INFO L225 Difference]: With dead ends: 160 [2024-11-19 06:52:31,420 INFO L226 Difference]: Without dead ends: 160 [2024-11-19 06:52:31,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=805, Unknown=1, NotChecked=58, Total=992 [2024-11-19 06:52:31,420 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 21 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:52:31,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 619 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 497 Invalid, 0 Unknown, 84 Unchecked, 0.2s Time] [2024-11-19 06:52:31,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-19 06:52:31,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2024-11-19 06:52:31,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 129 states have (on average 1.302325581395349) internal successors, (168), 155 states have internal predecessors, (168), 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-19 06:52:31,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 174 transitions. [2024-11-19 06:52:31,425 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 174 transitions. Word has length 48 [2024-11-19 06:52:31,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:52:31,425 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 174 transitions. [2024-11-19 06:52:31,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 21 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 06:52:31,426 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 174 transitions. [2024-11-19 06:52:31,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-19 06:52:31,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:52:31,426 INFO L215 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, 1, 1, 1, 1, 1, 1] [2024-11-19 06:52:31,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-19 06:52:31,627 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,SelfDestructingSolverStorable37 [2024-11-19 06:52:31,627 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 06:52:31,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:52:31,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1010718078, now seen corresponding path program 1 times [2024-11-19 06:52:31,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:52:31,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489394056] [2024-11-19 06:52:31,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:52:31,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:52:31,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:52:32,437 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:52:32,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:52:32,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489394056] [2024-11-19 06:52:32,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489394056] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:52:32,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588592549] [2024-11-19 06:52:32,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:52:32,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:52:32,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:52:32,439 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-19 06:52:32,440 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-19 06:52:32,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:52:32,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-19 06:52:32,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:52:32,679 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-19 06:52:32,743 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:52:32,743 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-19 06:52:32,776 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-19 06:52:32,778 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-19 06:52:32,843 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 06:52:32,844 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-19 06:52:32,848 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-19 06:52:32,942 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 06:52:32,943 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-19 06:52:32,946 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-19 06:52:33,013 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 06:52:33,014 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-19 06:52:33,018 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-19 06:52:33,035 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-19 06:52:33,041 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-19 06:52:33,105 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-19 06:52:33,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:52:33,125 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-19 06:52:33,133 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:52:33,133 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-19 06:52:33,161 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-19 06:52:33,161 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:52:33,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588592549] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:52:33,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:52:33,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 30 [2024-11-19 06:52:33,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283204965] [2024-11-19 06:52:33,250 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:52:33,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-19 06:52:33,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:52:33,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-19 06:52:33,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=892, Unknown=1, NotChecked=60, Total=1056 [2024-11-19 06:52:33,251 INFO L87 Difference]: Start difference. First operand 160 states and 174 transitions. Second operand has 31 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 25 states have internal predecessors, (68), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-19 06:52:34,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:52:34,031 INFO L93 Difference]: Finished difference Result 155 states and 169 transitions. [2024-11-19 06:52:34,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 06:52:34,031 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 25 states have internal predecessors, (68), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 48 [2024-11-19 06:52:34,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:52:34,032 INFO L225 Difference]: With dead ends: 155 [2024-11-19 06:52:34,032 INFO L226 Difference]: Without dead ends: 155 [2024-11-19 06:52:34,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=227, Invalid=1582, Unknown=1, NotChecked=82, Total=1892 [2024-11-19 06:52:34,033 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 59 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 06:52:34,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 963 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 987 Invalid, 0 Unknown, 98 Unchecked, 0.5s Time] [2024-11-19 06:52:34,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-19 06:52:34,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2024-11-19 06:52:34,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 129 states have (on average 1.2635658914728682) internal successors, (163), 150 states have internal predecessors, (163), 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-19 06:52:34,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 169 transitions. [2024-11-19 06:52:34,037 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 169 transitions. Word has length 48 [2024-11-19 06:52:34,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:52:34,037 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 169 transitions. [2024-11-19 06:52:34,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 25 states have internal predecessors, (68), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-19 06:52:34,037 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 169 transitions. [2024-11-19 06:52:34,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-19 06:52:34,038 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:52:34,038 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:52:34,060 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-19 06:52:34,245 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,SelfDestructingSolverStorable38 [2024-11-19 06:52:34,246 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 06:52:34,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:52:34,246 INFO L85 PathProgramCache]: Analyzing trace with hash -917682268, now seen corresponding path program 1 times [2024-11-19 06:52:34,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:52:34,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69701312] [2024-11-19 06:52:34,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:52:34,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:52:34,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:52:35,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:52:35,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:52:35,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69701312] [2024-11-19 06:52:35,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69701312] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:52:35,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737433568] [2024-11-19 06:52:35,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:52:35,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:52:35,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:52:35,764 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-19 06:52:35,765 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-19 06:52:35,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:52:35,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-19 06:52:35,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:52:36,069 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-19 06:52:36,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 27 [2024-11-19 06:52:36,148 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2024-11-19 06:52:36,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 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 23 treesize of output 37 [2024-11-19 06:52:36,246 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-19 06:52:36,295 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 59 treesize of output 39 [2024-11-19 06:52:37,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:52:37,916 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:52:37,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 1670 treesize of output 876 [2024-11-19 06:52:52,131 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse2 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| 1))) (let ((.cse13 (exists ((v_arrayElimCell_137 Int)) (and (not (= v_arrayElimCell_137 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_137)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_137) 0)))) (.cse4 (not (= |c_ULTIMATE.start_destroy_~l#1.offset| 24))) (.cse17 (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_13| Int) (v_arrayElimCell_134 Int) (v_prenex_21 Int) (v_prenex_20 Int)) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem19#1.base_13| 1) v_arrayElimCell_134 0) |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134 v_prenex_21) |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_20) |v_ULTIMATE.start_destroy_#t~mem19#1.base_13| 1) |c_ULTIMATE.start_destroy_~l#1.base|) v_prenex_20) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134 0) |v_ULTIMATE.start_destroy_#t~mem19#1.base_13| 0)) (not (= |v_ULTIMATE.start_destroy_#t~mem19#1.base_13| 0))))) (.cse19 (exists ((v_prenex_5 Int) (|v_ULTIMATE.start_destroy_#t~mem19#1.base_13| Int) (v_arrayElimCell_134 Int)) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_5) |v_ULTIMATE.start_destroy_#t~mem19#1.base_13| 1) |c_ULTIMATE.start_destroy_~l#1.base|) v_prenex_5) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem19#1.base_13| 1) v_arrayElimCell_134 0) |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134 0) |v_ULTIMATE.start_destroy_#t~mem19#1.base_13| 0)) (not (= |v_ULTIMATE.start_destroy_#t~mem19#1.base_13| 0))))) (.cse8 (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_13| Int) (v_arrayElimCell_134 Int) (v_arrayElimCell_136 Int)) (let ((.cse59 (select |c_#valid| v_arrayElimCell_136))) (let ((.cse57 (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_136 .cse59) |c_ULTIMATE.start_destroy_~l#1.base| 1))) (let ((.cse58 (store (store .cse57 |v_ULTIMATE.start_destroy_#t~mem19#1.base_13| 1) v_arrayElimCell_134 0))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem19#1.base_13|) 0) (= |c_#valid| (store (store .cse57 v_arrayElimCell_134 0) |v_ULTIMATE.start_destroy_#t~mem19#1.base_13| 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| |v_ULTIMATE.start_destroy_#t~mem19#1.base_13|)) (not (= v_arrayElimCell_136 v_arrayElimCell_134)) (= (select .cse58 |v_ULTIMATE.start_destroy_#t~mem19#1.base_13|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_136) 0) (= .cse59 (select .cse58 v_arrayElimCell_136)) (not (= |v_ULTIMATE.start_destroy_#t~mem19#1.base_13| 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_136)) (= (select .cse58 |c_ULTIMATE.start_destroy_~l#1.base|) 1))))))) (.cse26 (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_13| Int) (v_arrayElimCell_134 Int)) (let ((.cse56 (store (store .cse2 |v_ULTIMATE.start_destroy_#t~mem19#1.base_13| 1) v_arrayElimCell_134 0))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem19#1.base_13|) 0) (not (= |c_ULTIMATE.start_destroy_~l#1.base| |v_ULTIMATE.start_destroy_#t~mem19#1.base_13|)) (= (select .cse56 |v_ULTIMATE.start_destroy_#t~mem19#1.base_13|) 1) (= |c_#valid| (store (store .cse2 v_arrayElimCell_134 0) |v_ULTIMATE.start_destroy_#t~mem19#1.base_13| 0)) (not (= |v_ULTIMATE.start_destroy_#t~mem19#1.base_13| 0)) (= (select .cse56 |c_ULTIMATE.start_destroy_~l#1.base|) 1))))) (.cse29 (exists ((v_prenex_23 Int) (|v_ULTIMATE.start_destroy_#t~mem19#1.base_13| Int) (v_arrayElimCell_134 Int) (v_arrayElimCell_136 Int)) (let ((.cse55 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_136 (select |c_#valid| v_arrayElimCell_136)))) (let ((.cse54 (store (store .cse55 |v_ULTIMATE.start_destroy_#t~mem19#1.base_13| 1) v_arrayElimCell_134 0))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem19#1.base_13|) 0) (= (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_136 (select .cse54 v_arrayElimCell_136)) |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_23) |v_ULTIMATE.start_destroy_#t~mem19#1.base_13| 1) |c_ULTIMATE.start_destroy_~l#1.base|) v_prenex_23) (not (= v_arrayElimCell_136 v_arrayElimCell_134)) (not (= |v_ULTIMATE.start_destroy_#t~mem19#1.base_13| v_arrayElimCell_136)) (= |c_#valid| (store (store .cse55 v_arrayElimCell_134 0) |v_ULTIMATE.start_destroy_#t~mem19#1.base_13| 0)) (= (select .cse54 |v_ULTIMATE.start_destroy_#t~mem19#1.base_13|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_136) 0) (not (= |v_ULTIMATE.start_destroy_#t~mem19#1.base_13| 0)) (= (select .cse54 |c_ULTIMATE.start_destroy_~l#1.base|) 1)))))) (.cse0 (not (= |c_ULTIMATE.start_destroy_~l#1.offset| 0))) (.cse5 (exists ((v_prenex_34 Int) (|v_ULTIMATE.start_destroy_#t~mem19#1.base_13| Int) (v_arrayElimCell_134 Int)) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem19#1.base_13| 1) v_arrayElimCell_134 0) |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134 0) |v_ULTIMATE.start_destroy_#t~mem19#1.base_13| 0)) (not (= |v_ULTIMATE.start_destroy_#t~mem19#1.base_13| 0)) (= v_prenex_34 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_34) |v_ULTIMATE.start_destroy_#t~mem19#1.base_13| 1) |c_ULTIMATE.start_destroy_~l#1.base|))))) (.cse25 (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_13| Int) (v_arrayElimCell_134 Int)) (let ((.cse53 (store (store .cse2 |v_ULTIMATE.start_destroy_#t~mem19#1.base_13| 1) v_arrayElimCell_134 0))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem19#1.base_13|) 0) (not (= |c_ULTIMATE.start_destroy_~l#1.base| |v_ULTIMATE.start_destroy_#t~mem19#1.base_13|)) (= (select .cse53 |v_ULTIMATE.start_destroy_#t~mem19#1.base_13|) 1) (= |c_#valid| (store (store .cse2 v_arrayElimCell_134 0) |v_ULTIMATE.start_destroy_#t~mem19#1.base_13| 0)) (not (= |v_ULTIMATE.start_destroy_#t~mem19#1.base_13| 0)) (= (select .cse53 |c_ULTIMATE.start_destroy_~l#1.base|) 1)))))) (or (and .cse0 (or (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_13| Int) (v_arrayElimCell_137 Int)) (let ((.cse1 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem19#1.base_13| 1) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_137 0))) (and (= (select .cse1 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_137 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem19#1.base_13|) 0) (= (select .cse1 |v_ULTIMATE.start_destroy_#t~mem19#1.base_13|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_137) 0) (= |c_#valid| (store (store .cse2 v_arrayElimCell_137 0) |v_ULTIMATE.start_destroy_#t~mem19#1.base_13| 0))))) (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_13| Int) (v_arrayElimCell_137 Int)) (let ((.cse3 (store .cse2 v_arrayElimCell_137 0))) (and (= (select .cse3 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= (select .cse3 |v_ULTIMATE.start_destroy_#t~mem19#1.base_13|) 1) (not (= v_arrayElimCell_137 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_137) 0) (= |c_#valid| (store .cse3 |v_ULTIMATE.start_destroy_#t~mem19#1.base_13| 0))))) (and .cse4 (or .cse5 (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_13| Int) (v_arrayElimCell_134 Int) (v_arrayElimCell_137 Int)) (let ((.cse7 (select |c_#valid| v_arrayElimCell_137))) (let ((.cse6 (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem19#1.base_13| 1) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_137 .cse7) v_arrayElimCell_134 0))) (and (= (select .cse6 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_137 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem19#1.base_13|) 0) (= (select .cse6 |v_ULTIMATE.start_destroy_#t~mem19#1.base_13|) 1) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_137)) (= |c_#valid| (store (store (store .cse2 v_arrayElimCell_137 .cse7) v_arrayElimCell_134 0) |v_ULTIMATE.start_destroy_#t~mem19#1.base_13| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_137) 0) (not (= v_arrayElimCell_137 v_arrayElimCell_134)))))) .cse8 (exists ((v_prenex_5 Int) (|v_ULTIMATE.start_destroy_#t~mem19#1.base_13| Int) (v_arrayElimCell_134 Int) (v_arrayElimCell_137 Int)) (let ((.cse9 (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_137 (select |c_#valid| v_arrayElimCell_137)) v_arrayElimCell_134 0))) (and (= |c_#valid| (store .cse9 |v_ULTIMATE.start_destroy_#t~mem19#1.base_13| 0)) (= (select .cse9 |v_ULTIMATE.start_destroy_#t~mem19#1.base_13|) 1) (not (= v_arrayElimCell_137 0)) (= (select .cse9 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_5) v_arrayElimCell_137 (select .cse9 v_arrayElimCell_137)) |c_ULTIMATE.start_destroy_~l#1.base|) v_prenex_5)))) (exists ((v_arrayElimCell_134 Int) (v_arrayElimCell_137 Int)) (let ((.cse10 (store (store .cse2 v_arrayElimCell_137 1) v_arrayElimCell_134 0))) (and (= (select .cse10 v_arrayElimCell_137) 1) (not (= v_arrayElimCell_137 0)) (= |c_#valid| (store (store .cse2 v_arrayElimCell_134 0) v_arrayElimCell_137 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_137)) (= (select .cse10 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_137) 0)))) (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_13| Int) (v_arrayElimCell_134 Int)) (let ((.cse11 (store .cse2 v_arrayElimCell_134 0))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (= |c_#valid| (store .cse11 |v_ULTIMATE.start_destroy_#t~mem19#1.base_13| 0)) (= (select .cse11 |v_ULTIMATE.start_destroy_#t~mem19#1.base_13|) 1) (not (= v_arrayElimCell_134 0)) (= (select .cse11 |c_ULTIMATE.start_destroy_~l#1.base|) 1)))) (and (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_13| Int) (v_arrayElimCell_134 Int)) (let ((.cse12 (store .cse2 v_arrayElimCell_134 0))) (and (= |c_#valid| (store .cse12 |v_ULTIMATE.start_destroy_#t~mem19#1.base_13| 0)) (= (select .cse12 |v_ULTIMATE.start_destroy_#t~mem19#1.base_13|) 1) (= (select .cse12 |c_ULTIMATE.start_destroy_~l#1.base|) 1)))) .cse13) (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_13| Int) (v_arrayElimCell_134 Int) (v_arrayElimCell_136 Int)) (let ((.cse14 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_136 (select |c_#valid| v_arrayElimCell_136)) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_134 0))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (= |c_#valid| (store .cse14 |v_ULTIMATE.start_destroy_#t~mem19#1.base_13| 0)) (not (= v_arrayElimCell_136 v_arrayElimCell_134)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_134)) (not (= v_arrayElimCell_134 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_136) 0) (= (select .cse14 |v_ULTIMATE.start_destroy_#t~mem19#1.base_13|) 1) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_136))))) (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_13| Int) (v_arrayElimCell_134 Int) (v_arrayElimCell_137 Int)) (let ((.cse15 (store (store .cse2 v_arrayElimCell_137 (select |c_#valid| v_arrayElimCell_137)) v_arrayElimCell_134 0))) (and (not (= v_arrayElimCell_137 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_137)) (= |c_#valid| (store .cse15 |v_ULTIMATE.start_destroy_#t~mem19#1.base_13| 0)) (= (select .cse15 |v_ULTIMATE.start_destroy_#t~mem19#1.base_13|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_137) 0) (not (= v_arrayElimCell_137 v_arrayElimCell_134)) (= (select .cse15 |c_ULTIMATE.start_destroy_~l#1.base|) 1)))) (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_13| Int) (v_arrayElimCell_134 Int) (v_arrayElimCell_136 Int)) (let ((.cse16 (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_136 (select |c_#valid| v_arrayElimCell_136)) v_arrayElimCell_134 0))) (and (= (select .cse16 |v_ULTIMATE.start_destroy_#t~mem19#1.base_13|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (= (select .cse16 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_134 0)) (= |c_#valid| (store .cse16 |v_ULTIMATE.start_destroy_#t~mem19#1.base_13| 0))))) (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_13| Int) (v_arrayElimCell_134 Int)) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem19#1.base_13| 1) v_arrayElimCell_134 0) |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134 0) |v_ULTIMATE.start_destroy_#t~mem19#1.base_13| 0)) (not (= v_arrayElimCell_134 0)))) .cse17 (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_13| Int) (v_arrayElimCell_134 Int) (v_arrayElimCell_137 Int)) (let ((.cse18 (store (store .cse2 v_arrayElimCell_137 (select |c_#valid| v_arrayElimCell_137)) v_arrayElimCell_134 0))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (not (= v_arrayElimCell_137 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_137)) (= |c_#valid| (store .cse18 |v_ULTIMATE.start_destroy_#t~mem19#1.base_13| 0)) (= (select .cse18 |v_ULTIMATE.start_destroy_#t~mem19#1.base_13|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_137) 0) (not (= v_arrayElimCell_137 v_arrayElimCell_134)) (= (select .cse18 |c_ULTIMATE.start_destroy_~l#1.base|) 1)))) .cse19 (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_13| Int) (v_arrayElimCell_134 Int)) (let ((.cse20 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem19#1.base_13| 1) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_134 0))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem19#1.base_13|) 0) (= |c_#valid| (store (store .cse2 v_arrayElimCell_134 0) |v_ULTIMATE.start_destroy_#t~mem19#1.base_13| 0)) (not (= v_arrayElimCell_134 0)) (= (select .cse20 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= 1 (select .cse20 |v_ULTIMATE.start_destroy_#t~mem19#1.base_13|))))) (exists ((v_prenex_23 Int) (|v_ULTIMATE.start_destroy_#t~mem19#1.base_13| Int) (v_arrayElimCell_134 Int) (v_arrayElimCell_137 Int)) (let ((.cse23 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem19#1.base_13| 1)) (.cse21 (select |c_#valid| v_arrayElimCell_137))) (let ((.cse22 (store (store .cse23 v_arrayElimCell_137 .cse21) v_arrayElimCell_134 0))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_137 .cse21) v_arrayElimCell_134 0) |v_ULTIMATE.start_destroy_#t~mem19#1.base_13| 0)) (not (= v_arrayElimCell_137 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem19#1.base_13|) 0) (= (select .cse22 |v_ULTIMATE.start_destroy_#t~mem19#1.base_13|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_137) 0) (not (= v_arrayElimCell_137 v_arrayElimCell_134)) (= v_prenex_23 (select (store (store .cse23 |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_23) v_arrayElimCell_137 (select .cse22 v_arrayElimCell_137)) |c_ULTIMATE.start_destroy_~l#1.base|)) (= (select .cse22 |c_ULTIMATE.start_destroy_~l#1.base|) 1))))) (exists ((v_prenex_39 Int) (|v_ULTIMATE.start_destroy_#t~mem19#1.base_13| Int) (v_prenex_41 Int) (v_arrayElimCell_134 Int) (v_arrayElimCell_137 Int)) (let ((.cse24 (store .cse2 v_arrayElimCell_134 0))) (and (= v_prenex_41 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134 v_prenex_41) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_137 v_prenex_39) v_arrayElimCell_134)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (not (= v_arrayElimCell_137 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_137)) (= |c_#valid| (store .cse24 |v_ULTIMATE.start_destroy_#t~mem19#1.base_13| 0)) (= (select .cse24 |v_ULTIMATE.start_destroy_#t~mem19#1.base_13|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_137) 0) (= (select .cse24 |c_ULTIMATE.start_destroy_~l#1.base|) 1)))) .cse25 .cse26 (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_13| Int) (v_arrayElimCell_134 Int) (v_prenex_21 Int) (v_arrayElimCell_137 Int) (v_prenex_20 Int)) (let ((.cse27 (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_137 (select |c_#valid| v_arrayElimCell_137)) v_arrayElimCell_134 0))) (and (= |c_#valid| (store .cse27 |v_ULTIMATE.start_destroy_#t~mem19#1.base_13| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (= (select .cse27 |v_ULTIMATE.start_destroy_#t~mem19#1.base_13|) 1) (not (= v_arrayElimCell_137 0)) (= (select .cse27 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134 v_prenex_21) |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_20) v_arrayElimCell_137 (select .cse27 v_arrayElimCell_137)) |c_ULTIMATE.start_destroy_~l#1.base|) v_prenex_20)))) (exists ((v_prenex_34 Int) (|v_ULTIMATE.start_destroy_#t~mem19#1.base_13| Int) (v_arrayElimCell_134 Int) (v_arrayElimCell_137 Int)) (let ((.cse28 (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_137 (select |c_#valid| v_arrayElimCell_137)) v_arrayElimCell_134 0))) (and (= |c_#valid| (store .cse28 |v_ULTIMATE.start_destroy_#t~mem19#1.base_13| 0)) (= (select .cse28 |v_ULTIMATE.start_destroy_#t~mem19#1.base_13|) 1) (not (= v_arrayElimCell_137 0)) (= (select .cse28 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_34) v_arrayElimCell_137 (select .cse28 v_arrayElimCell_137)) |c_ULTIMATE.start_destroy_~l#1.base|) v_prenex_34)))) .cse29 (exists ((v_prenex_23 Int) (|v_ULTIMATE.start_destroy_#t~mem19#1.base_13| Int) (v_arrayElimCell_134 Int) (v_arrayElimCell_137 Int) (v_arrayElimCell_136 Int)) (let ((.cse30 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_136 (select |c_#valid| v_arrayElimCell_136)) v_arrayElimCell_137 (select |c_#valid| v_arrayElimCell_137)) v_arrayElimCell_134 0))) (and (not (= v_arrayElimCell_137 0)) (= (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_136 (select .cse30 v_arrayElimCell_136)) |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_23) v_arrayElimCell_137 (select .cse30 v_arrayElimCell_137)) |c_ULTIMATE.start_destroy_~l#1.base|) v_prenex_23) (= (select .cse30 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_136 v_arrayElimCell_134)) (= |c_#valid| (store .cse30 |v_ULTIMATE.start_destroy_#t~mem19#1.base_13| 0)) (= (select .cse30 |v_ULTIMATE.start_destroy_#t~mem19#1.base_13|) 1) (not (= v_arrayElimCell_137 v_arrayElimCell_136)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_137) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_136) 0) (not (= v_arrayElimCell_137 v_arrayElimCell_134))))) (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_13| Int) (v_arrayElimCell_134 Int) (v_arrayElimCell_137 Int) (v_arrayElimCell_136 Int)) (let ((.cse31 (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_136 (select |c_#valid| v_arrayElimCell_136)) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_137 (select |c_#valid| v_arrayElimCell_137)) v_arrayElimCell_134 0))) (and (not (= v_arrayElimCell_137 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_137)) (= (select .cse31 |v_ULTIMATE.start_destroy_#t~mem19#1.base_13|) 1) (not (= v_arrayElimCell_136 v_arrayElimCell_134)) (= (select .cse31 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_137 v_arrayElimCell_136)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_137) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_136) 0) (= |c_#valid| (store .cse31 |v_ULTIMATE.start_destroy_#t~mem19#1.base_13| 0)) (not (= v_arrayElimCell_137 v_arrayElimCell_134)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_136))))))) (exists ((|v_ULTIMATE.start_destroy_#t~mem19#1.base_13| Int) (v_arrayElimCell_137 Int) (v_arrayElimCell_136 Int)) (let ((.cse32 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_136 (select |c_#valid| v_arrayElimCell_136)) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_137 0))) (and (= (select .cse32 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= |c_#valid| (store .cse32 |v_ULTIMATE.start_destroy_#t~mem19#1.base_13| 0)) (not (= v_arrayElimCell_137 0)) (not (= v_arrayElimCell_137 v_arrayElimCell_136)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_137) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_136) 0) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_136)) (= (select .cse32 |v_ULTIMATE.start_destroy_#t~mem19#1.base_13|) 1)))))) (and (let ((.cse36 (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0))) (or (and (or (exists ((v_prenex_5 Int) (v_arrayElimCell_134 Int) (v_arrayElimCell_137 Int)) (let ((.cse33 (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_137 (select |c_#valid| v_arrayElimCell_137)) v_arrayElimCell_134 0))) (and (= |c_#valid| (store .cse33 0 0)) (= (select .cse33 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_5) v_arrayElimCell_137 (select .cse33 v_arrayElimCell_137)) |c_ULTIMATE.start_destroy_~l#1.base|) v_prenex_5)))) (exists ((v_prenex_23 Int) (v_arrayElimCell_134 Int) (v_arrayElimCell_137 Int) (v_arrayElimCell_136 Int)) (let ((.cse34 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_136 (select |c_#valid| v_arrayElimCell_136)) v_arrayElimCell_137 (select |c_#valid| v_arrayElimCell_137)) v_arrayElimCell_134 0))) (and (not (= v_arrayElimCell_137 0)) (= |c_#valid| (store .cse34 0 0)) (= (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_136 (select .cse34 v_arrayElimCell_136)) |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_23) v_arrayElimCell_137 (select .cse34 v_arrayElimCell_137)) |c_ULTIMATE.start_destroy_~l#1.base|) v_prenex_23) (= (select .cse34 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_136 v_arrayElimCell_134)) (not (= v_arrayElimCell_137 v_arrayElimCell_136)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_137) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_136) 0) (not (= v_arrayElimCell_136 0)) (not (= v_arrayElimCell_137 v_arrayElimCell_134))))) (exists ((v_arrayElimCell_134 Int) (v_arrayElimCell_136 Int)) (let ((.cse35 (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_136 (select |c_#valid| v_arrayElimCell_136)) v_arrayElimCell_134 0))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (= (select .cse35 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_134 0)) (= |c_#valid| (store .cse35 0 0))))) (and .cse36 (or (exists ((v_DerPreprocessor_23 Int) (v_arrayElimCell_134 Int)) (let ((.cse37 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_23) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_134 0))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (= |c_#valid| (store (store .cse2 v_arrayElimCell_134 0) 0 0)) (= v_DerPreprocessor_23 (select .cse37 0)) (not (= v_arrayElimCell_134 0)) (= (select .cse37 |c_ULTIMATE.start_destroy_~l#1.base|) 1)))) (exists ((v_DerPreprocessor_23 Int) (v_arrayElimCell_134 Int) (v_arrayElimCell_137 Int)) (let ((.cse39 (select |c_#valid| v_arrayElimCell_137))) (let ((.cse38 (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_23) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_137 .cse39) v_arrayElimCell_134 0))) (and (= v_DerPreprocessor_23 (select .cse38 0)) (not (= v_arrayElimCell_137 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_137)) (= |c_#valid| (store (store (store .cse2 v_arrayElimCell_137 .cse39) v_arrayElimCell_134 0) 0 0)) (= (select .cse38 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_137) 0) (not (= v_arrayElimCell_137 v_arrayElimCell_134)))))))) (and .cse13 (exists ((v_arrayElimCell_134 Int)) (let ((.cse40 (store .cse2 v_arrayElimCell_134 0))) (and (= |c_#valid| (store .cse40 0 0)) (= (select .cse40 |c_ULTIMATE.start_destroy_~l#1.base|) 1))))) (exists ((v_arrayElimCell_134 Int) (v_arrayElimCell_136 Int)) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_136 (select |c_#valid| v_arrayElimCell_136)) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_134 0) 0 0)) (not (= v_arrayElimCell_136 v_arrayElimCell_134)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_134)) (not (= v_arrayElimCell_134 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_136) 0) (not (= v_arrayElimCell_136 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_136)))) (exists ((v_arrayElimCell_134 Int) (v_prenex_21 Int) (v_arrayElimCell_137 Int) (v_prenex_20 Int)) (let ((.cse41 (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_137 (select |c_#valid| v_arrayElimCell_137)) v_arrayElimCell_134 0))) (and (= |c_#valid| (store .cse41 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (= (select .cse41 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134 v_prenex_21) |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_20) v_arrayElimCell_137 (select .cse41 v_arrayElimCell_137)) |c_ULTIMATE.start_destroy_~l#1.base|) v_prenex_20)))) (exists ((v_arrayElimCell_134 Int) (v_arrayElimCell_137 Int)) (let ((.cse42 (store (store .cse2 v_arrayElimCell_137 (select |c_#valid| v_arrayElimCell_137)) v_arrayElimCell_134 0))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (not (= v_arrayElimCell_137 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_137)) (= |c_#valid| (store .cse42 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_137) 0) (not (= v_arrayElimCell_137 v_arrayElimCell_134)) (= (select .cse42 |c_ULTIMATE.start_destroy_~l#1.base|) 1)))) (exists ((v_arrayElimCell_134 Int) (v_arrayElimCell_137 Int) (v_arrayElimCell_136 Int)) (let ((.cse43 (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_136 (select |c_#valid| v_arrayElimCell_136)) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_137 (select |c_#valid| v_arrayElimCell_137)) v_arrayElimCell_134 0))) (and (not (= v_arrayElimCell_137 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_137)) (not (= v_arrayElimCell_136 v_arrayElimCell_134)) (= (select .cse43 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_137 v_arrayElimCell_136)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_137) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_136) 0) (not (= v_arrayElimCell_136 0)) (not (= v_arrayElimCell_137 v_arrayElimCell_134)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_136)) (= |c_#valid| (store .cse43 0 0))))) (and .cse36 (or (exists ((v_DerPreprocessor_17 Int) (v_arrayElimCell_134 Int)) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_17) v_arrayElimCell_134 0) |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134 0) 0 0)))) (exists ((v_DerPreprocessor_17 Int) (v_prenex_23 Int) (v_arrayElimCell_134 Int) (v_arrayElimCell_137 Int)) (let ((.cse44 (select |c_#valid| v_arrayElimCell_137))) (let ((.cse45 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_17) v_arrayElimCell_137 .cse44) v_arrayElimCell_134 0))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_137 .cse44) v_arrayElimCell_134 0) 0 0)) (= v_prenex_23 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select .cse45 0)) |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_23) v_arrayElimCell_137 (select .cse45 v_arrayElimCell_137)) |c_ULTIMATE.start_destroy_~l#1.base|)) (not (= v_arrayElimCell_134 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_137) 0) (= (select .cse45 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_137 v_arrayElimCell_134)))))))) (exists ((v_prenex_39 Int) (v_prenex_41 Int) (v_arrayElimCell_134 Int) (v_arrayElimCell_137 Int)) (let ((.cse46 (store .cse2 v_arrayElimCell_134 0))) (and (= v_prenex_41 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134 v_prenex_41) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_137 v_prenex_39) v_arrayElimCell_134)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (not (= v_arrayElimCell_137 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_137)) (= |c_#valid| (store .cse46 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_137) 0) (= (select .cse46 |c_ULTIMATE.start_destroy_~l#1.base|) 1)))) (exists ((v_arrayElimCell_134 Int) (v_arrayElimCell_137 Int)) (let ((.cse47 (store (store .cse2 v_arrayElimCell_137 (select |c_#valid| v_arrayElimCell_137)) v_arrayElimCell_134 0))) (and (not (= v_arrayElimCell_137 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_137)) (= |c_#valid| (store .cse47 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_137) 0) (not (= v_arrayElimCell_137 v_arrayElimCell_134)) (= (select .cse47 |c_ULTIMATE.start_destroy_~l#1.base|) 1)))) (exists ((v_prenex_34 Int) (v_arrayElimCell_134 Int) (v_arrayElimCell_137 Int)) (let ((.cse48 (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_137 (select |c_#valid| v_arrayElimCell_137)) v_arrayElimCell_134 0))) (and (= |c_#valid| (store .cse48 0 0)) (= (select .cse48 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_34) v_arrayElimCell_137 (select .cse48 v_arrayElimCell_137)) |c_ULTIMATE.start_destroy_~l#1.base|) v_prenex_34)))) (exists ((v_arrayElimCell_134 Int)) (let ((.cse49 (store .cse2 v_arrayElimCell_134 0))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (= |c_#valid| (store .cse49 0 0)) (not (= v_arrayElimCell_134 0)) (= (select .cse49 |c_ULTIMATE.start_destroy_~l#1.base|) 1))))) .cse4) (exists ((v_arrayElimCell_137 Int)) (let ((.cse50 (store .cse2 v_arrayElimCell_137 0))) (and (= (select .cse50 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_137 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_137) 0) (= |c_#valid| (store .cse50 0 0))))) (exists ((v_arrayElimCell_137 Int) (v_arrayElimCell_136 Int)) (let ((.cse51 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_136 (select |c_#valid| v_arrayElimCell_136)) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_137 0))) (and (= (select .cse51 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_137 0)) (not (= v_arrayElimCell_137 v_arrayElimCell_136)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_137) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_136) 0) (not (= v_arrayElimCell_136 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_136)) (= |c_#valid| (store .cse51 0 0))))) (and .cse36 (exists ((v_DerPreprocessor_16 Int) (v_arrayElimCell_137 Int)) (let ((.cse52 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_16) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_137 0))) (and (= (select .cse52 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_137 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_137) 0) (= |c_#valid| (store (store .cse2 v_arrayElimCell_137 0) 0 0)) (= (select .cse52 0) v_DerPreprocessor_16))))))) .cse0) (and .cse4 (or .cse17 (and .cse19 .cse0) .cse26 (and (or .cse8 .cse25 .cse26 .cse29) .cse0) (and .cse0 (or .cse5 .cse25))))))) (<= 0 |c_ULTIMATE.start_destroy_~l#1.offset|) (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base|) 0)) is different from false [2024-11-19 06:52:58,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2024-11-19 06:52:58,083 INFO L311 TraceCheckSpWp]: Computing backward predicates...