./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/dll-lst-shared.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/dll-lst-shared.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6f8708414d69d58e69308ef3f6436b82a3a2ac306b0f68b7007fd3139e12ef15 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:50:42,887 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:50:42,961 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-10-13 10:50:42,966 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:50:42,967 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:50:42,991 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:50:42,992 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:50:42,992 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:50:42,992 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:50:42,993 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:50:42,993 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:50:42,993 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:50:42,993 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:50:42,994 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:50:42,994 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:50:42,997 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:50:42,997 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:50:42,998 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:50:42,998 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:50:42,998 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:50:42,998 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 10:50:43,002 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:50:43,003 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:50:43,003 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:50:43,003 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:50:43,003 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:50:43,003 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:50:43,003 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:50:43,004 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:50:43,004 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:50:43,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:50:43,004 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:50:43,004 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:50:43,004 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:50:43,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:50:43,004 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:50:43,005 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:50:43,005 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:50:43,005 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:50:43,005 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6f8708414d69d58e69308ef3f6436b82a3a2ac306b0f68b7007fd3139e12ef15 [2024-10-13 10:50:43,211 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:50:43,227 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:50:43,229 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:50:43,230 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:50:43,231 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:50:43,232 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/dll-lst-shared.i [2024-10-13 10:50:44,489 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:50:44,709 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:50:44,709 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/dll-lst-shared.i [2024-10-13 10:50:44,738 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/493d80087/0f4636037a1f4fd99bfadab578f02499/FLAG91a83682f [2024-10-13 10:50:45,050 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/493d80087/0f4636037a1f4fd99bfadab578f02499 [2024-10-13 10:50:45,053 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:50:45,054 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:50:45,055 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:50:45,055 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:50:45,061 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:50:45,062 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:50:45" (1/1) ... [2024-10-13 10:50:45,063 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@296f83c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:50:45, skipping insertion in model container [2024-10-13 10:50:45,063 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:50:45" (1/1) ... [2024-10-13 10:50:45,102 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:50:45,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:50:45,389 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:50:45,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:50:45,440 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:50:45,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:50:45 WrapperNode [2024-10-13 10:50:45,441 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:50:45,442 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:50:45,442 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:50:45,442 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:50:45,447 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:50:45" (1/1) ... [2024-10-13 10:50:45,459 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:50:45" (1/1) ... [2024-10-13 10:50:45,479 INFO L138 Inliner]: procedures = 121, calls = 26, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 78 [2024-10-13 10:50:45,480 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:50:45,480 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:50:45,480 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:50:45,481 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:50:45,492 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:50:45" (1/1) ... [2024-10-13 10:50:45,492 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:50:45" (1/1) ... [2024-10-13 10:50:45,498 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:50:45" (1/1) ... [2024-10-13 10:50:45,526 INFO L175 MemorySlicer]: Split 14 memory accesses to 1 slices as follows [14]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 7 writes are split as follows [7]. [2024-10-13 10:50:45,527 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:50:45" (1/1) ... [2024-10-13 10:50:45,527 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:50:45" (1/1) ... [2024-10-13 10:50:45,531 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:50:45" (1/1) ... [2024-10-13 10:50:45,537 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:50:45" (1/1) ... [2024-10-13 10:50:45,539 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:50:45" (1/1) ... [2024-10-13 10:50:45,539 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:50:45" (1/1) ... [2024-10-13 10:50:45,541 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:50:45,546 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:50:45,546 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:50:45,546 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:50:45,547 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:50:45" (1/1) ... [2024-10-13 10:50:45,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:50:45,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:50:45,579 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-10-13 10:50:45,584 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-10-13 10:50:45,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 10:50:45,624 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2024-10-13 10:50:45,624 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2024-10-13 10:50:45,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 10:50:45,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 10:50:45,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 10:50:45,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 10:50:45,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:50:45,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:50:45,735 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:50:45,736 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:50:45,976 INFO L? ?]: Removed 88 outVars from TransFormulas that were not future-live. [2024-10-13 10:50:45,976 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:50:46,014 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:50:46,015 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-13 10:50:46,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:50:46 BoogieIcfgContainer [2024-10-13 10:50:46,020 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:50:46,022 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:50:46,022 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:50:46,028 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:50:46,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:50:45" (1/3) ... [2024-10-13 10:50:46,029 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35148657 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:50:46, skipping insertion in model container [2024-10-13 10:50:46,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:50:45" (2/3) ... [2024-10-13 10:50:46,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35148657 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:50:46, skipping insertion in model container [2024-10-13 10:50:46,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:50:46" (3/3) ... [2024-10-13 10:50:46,031 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-lst-shared.i [2024-10-13 10:50:46,046 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:50:46,046 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 35 error locations. [2024-10-13 10:50:46,080 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:50:46,086 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;@66c8d1b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:50:46,086 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2024-10-13 10:50:46,089 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 32 states have (on average 2.3125) internal successors, (74), 67 states have internal predecessors, (74), 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-10-13 10:50:46,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-13 10:50:46,094 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:50:46,095 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-13 10:50:46,095 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-13 10:50:46,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:50:46,099 INFO L85 PathProgramCache]: Analyzing trace with hash 5153845, now seen corresponding path program 1 times [2024-10-13 10:50:46,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:50:46,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10527358] [2024-10-13 10:50:46,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:50:46,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:50:46,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:50:46,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:50:46,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:50:46,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10527358] [2024-10-13 10:50:46,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10527358] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:50:46,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:50:46,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:50:46,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115333598] [2024-10-13 10:50:46,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:50:46,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:50:46,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:50:46,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:50:46,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:50:46,335 INFO L87 Difference]: Start difference. First operand has 71 states, 32 states have (on average 2.3125) internal successors, (74), 67 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-10-13 10:50:46,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:50:46,425 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2024-10-13 10:50:46,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:50:46,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 4 [2024-10-13 10:50:46,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:50:46,436 INFO L225 Difference]: With dead ends: 69 [2024-10-13 10:50:46,436 INFO L226 Difference]: Without dead ends: 68 [2024-10-13 10:50:46,438 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-10-13 10:50:46,441 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 1 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 93 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-10-13 10:50:46,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 93 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:50:46,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-13 10:50:46,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-13 10:50:46,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 32 states have (on average 2.125) internal successors, (68), 64 states have internal predecessors, (68), 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-10-13 10:50:46,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2024-10-13 10:50:46,470 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 4 [2024-10-13 10:50:46,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:50:46,470 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2024-10-13 10:50:46,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-10-13 10:50:46,471 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2024-10-13 10:50:46,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-13 10:50:46,471 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:50:46,471 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-13 10:50:46,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 10:50:46,471 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-13 10:50:46,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:50:46,472 INFO L85 PathProgramCache]: Analyzing trace with hash 5153846, now seen corresponding path program 1 times [2024-10-13 10:50:46,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:50:46,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094095820] [2024-10-13 10:50:46,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:50:46,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:50:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:50:46,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:50:46,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:50:46,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094095820] [2024-10-13 10:50:46,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094095820] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:50:46,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:50:46,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:50:46,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809005714] [2024-10-13 10:50:46,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:50:46,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:50:46,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:50:46,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:50:46,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:50:46,554 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-10-13 10:50:46,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:50:46,626 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2024-10-13 10:50:46,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:50:46,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 4 [2024-10-13 10:50:46,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:50:46,627 INFO L225 Difference]: With dead ends: 66 [2024-10-13 10:50:46,627 INFO L226 Difference]: Without dead ends: 66 [2024-10-13 10:50:46,627 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-10-13 10:50:46,628 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 1 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:50:46,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 98 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:50:46,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-13 10:50:46,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-13 10:50:46,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 32 states have (on average 2.0625) internal successors, (66), 62 states have internal predecessors, (66), 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-10-13 10:50:46,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2024-10-13 10:50:46,634 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 4 [2024-10-13 10:50:46,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:50:46,634 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2024-10-13 10:50:46,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-10-13 10:50:46,634 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2024-10-13 10:50:46,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-13 10:50:46,635 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:50:46,635 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:50:46,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 10:50:46,636 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-13 10:50:46,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:50:46,637 INFO L85 PathProgramCache]: Analyzing trace with hash 863364339, now seen corresponding path program 1 times [2024-10-13 10:50:46,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:50:46,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70495465] [2024-10-13 10:50:46,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:50:46,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:50:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:50:46,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:50:46,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:50:46,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:50:46,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:50:46,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70495465] [2024-10-13 10:50:46,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70495465] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:50:46,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:50:46,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:50:46,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279118634] [2024-10-13 10:50:46,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:50:46,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:50:46,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:50:46,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:50:46,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:50:46,792 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 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-10-13 10:50:46,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:50:46,891 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2024-10-13 10:50:46,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:50:46,892 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 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 8 [2024-10-13 10:50:46,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:50:46,893 INFO L225 Difference]: With dead ends: 69 [2024-10-13 10:50:46,894 INFO L226 Difference]: Without dead ends: 69 [2024-10-13 10:50:46,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:50:46,895 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 7 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:50:46,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 111 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:50:46,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-13 10:50:46,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2024-10-13 10:50:46,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 32 states have (on average 2.03125) internal successors, (65), 61 states have internal predecessors, (65), 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-10-13 10:50:46,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2024-10-13 10:50:46,902 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 8 [2024-10-13 10:50:46,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:50:46,903 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2024-10-13 10:50:46,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 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-10-13 10:50:46,903 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2024-10-13 10:50:46,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-13 10:50:46,903 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:50:46,903 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:50:46,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 10:50:46,904 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-13 10:50:46,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:50:46,904 INFO L85 PathProgramCache]: Analyzing trace with hash 863364338, now seen corresponding path program 1 times [2024-10-13 10:50:46,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:50:46,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721071978] [2024-10-13 10:50:46,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:50:46,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:50:46,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:50:46,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:50:46,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:50:46,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:50:46,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:50:46,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721071978] [2024-10-13 10:50:46,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721071978] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:50:46,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:50:46,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:50:46,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007875671] [2024-10-13 10:50:46,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:50:46,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:50:46,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:50:46,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:50:46,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:50:46,991 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 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-10-13 10:50:47,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:50:47,096 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2024-10-13 10:50:47,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:50:47,096 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 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 8 [2024-10-13 10:50:47,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:50:47,098 INFO L225 Difference]: With dead ends: 68 [2024-10-13 10:50:47,099 INFO L226 Difference]: Without dead ends: 68 [2024-10-13 10:50:47,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:50:47,100 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 7 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:50:47,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 106 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:50:47,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-13 10:50:47,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2024-10-13 10:50:47,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 32 states have (on average 2.0) internal successors, (64), 60 states have internal predecessors, (64), 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-10-13 10:50:47,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2024-10-13 10:50:47,106 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 8 [2024-10-13 10:50:47,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:50:47,106 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2024-10-13 10:50:47,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 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-10-13 10:50:47,106 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2024-10-13 10:50:47,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-13 10:50:47,106 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:50:47,107 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:50:47,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 10:50:47,107 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-13 10:50:47,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:50:47,107 INFO L85 PathProgramCache]: Analyzing trace with hash 994494627, now seen corresponding path program 1 times [2024-10-13 10:50:47,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:50:47,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581225878] [2024-10-13 10:50:47,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:50:47,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:50:47,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:50:47,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:50:47,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:50:47,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:50:47,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:50:47,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581225878] [2024-10-13 10:50:47,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581225878] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:50:47,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:50:47,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 10:50:47,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477433012] [2024-10-13 10:50:47,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:50:47,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:50:47,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:50:47,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:50:47,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:50:47,282 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 1 states have call successors, (1), 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-10-13 10:50:47,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:50:47,410 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2024-10-13 10:50:47,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:50:47,411 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 1 states have call successors, (1), 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 9 [2024-10-13 10:50:47,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:50:47,411 INFO L225 Difference]: With dead ends: 64 [2024-10-13 10:50:47,411 INFO L226 Difference]: Without dead ends: 64 [2024-10-13 10:50:47,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:50:47,413 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 24 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:50:47,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 165 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:50:47,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-13 10:50:47,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2024-10-13 10:50:47,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 32 states have (on average 1.875) internal successors, (60), 56 states have internal predecessors, (60), 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-10-13 10:50:47,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2024-10-13 10:50:47,422 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 9 [2024-10-13 10:50:47,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:50:47,423 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2024-10-13 10:50:47,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 1 states have call successors, (1), 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-10-13 10:50:47,425 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2024-10-13 10:50:47,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-13 10:50:47,425 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:50:47,426 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:50:47,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 10:50:47,426 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-13 10:50:47,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:50:47,426 INFO L85 PathProgramCache]: Analyzing trace with hash 994494628, now seen corresponding path program 1 times [2024-10-13 10:50:47,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:50:47,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048675691] [2024-10-13 10:50:47,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:50:47,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:50:47,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:50:47,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:50:47,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:50:47,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:50:47,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:50:47,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048675691] [2024-10-13 10:50:47,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048675691] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:50:47,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:50:47,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 10:50:47,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507478283] [2024-10-13 10:50:47,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:50:47,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:50:47,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:50:47,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:50:47,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:50:47,709 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 1 states have call successors, (1), 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-10-13 10:50:47,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:50:47,851 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2024-10-13 10:50:47,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:50:47,851 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 1 states have call successors, (1), 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 9 [2024-10-13 10:50:47,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:50:47,852 INFO L225 Difference]: With dead ends: 63 [2024-10-13 10:50:47,852 INFO L226 Difference]: Without dead ends: 63 [2024-10-13 10:50:47,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:50:47,856 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 4 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:50:47,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 170 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:50:47,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-13 10:50:47,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2024-10-13 10:50:47,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 32 states have (on average 1.84375) internal successors, (59), 55 states have internal predecessors, (59), 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-10-13 10:50:47,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2024-10-13 10:50:47,860 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 9 [2024-10-13 10:50:47,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:50:47,860 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2024-10-13 10:50:47,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 1 states have call successors, (1), 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-10-13 10:50:47,860 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2024-10-13 10:50:47,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 10:50:47,861 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:50:47,861 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:50:47,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 10:50:47,861 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-13 10:50:47,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:50:47,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1066816035, now seen corresponding path program 1 times [2024-10-13 10:50:47,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:50:47,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125784610] [2024-10-13 10:50:47,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:50:47,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:50:47,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:50:47,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:50:47,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:50:47,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:50:47,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:50:47,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125784610] [2024-10-13 10:50:47,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125784610] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:50:47,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:50:47,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:50:47,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497364924] [2024-10-13 10:50:47,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:50:47,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:50:47,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:50:47,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:50:47,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:50:47,958 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 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-10-13 10:50:48,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:50:48,079 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2024-10-13 10:50:48,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:50:48,080 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 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 14 [2024-10-13 10:50:48,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:50:48,080 INFO L225 Difference]: With dead ends: 83 [2024-10-13 10:50:48,080 INFO L226 Difference]: Without dead ends: 83 [2024-10-13 10:50:48,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:50:48,081 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 32 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:50:48,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 153 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:50:48,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-13 10:50:48,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 73. [2024-10-13 10:50:48,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 68 states have internal predecessors, (85), 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-10-13 10:50:48,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 91 transitions. [2024-10-13 10:50:48,092 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 91 transitions. Word has length 14 [2024-10-13 10:50:48,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:50:48,092 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 91 transitions. [2024-10-13 10:50:48,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 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-10-13 10:50:48,093 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 91 transitions. [2024-10-13 10:50:48,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 10:50:48,093 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:50:48,093 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:50:48,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 10:50:48,093 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-13 10:50:48,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:50:48,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1066816036, now seen corresponding path program 1 times [2024-10-13 10:50:48,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:50:48,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334164598] [2024-10-13 10:50:48,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:50:48,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:50:48,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:50:48,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:50:48,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:50:48,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:50:48,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:50:48,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334164598] [2024-10-13 10:50:48,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334164598] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:50:48,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:50:48,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 10:50:48,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077770209] [2024-10-13 10:50:48,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:50:48,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 10:50:48,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:50:48,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 10:50:48,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-13 10:50:48,266 INFO L87 Difference]: Start difference. First operand 73 states and 91 transitions. Second operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 1 states have call successors, (1), 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-10-13 10:50:48,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:50:48,409 INFO L93 Difference]: Finished difference Result 88 states and 101 transitions. [2024-10-13 10:50:48,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:50:48,410 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 1 states have call successors, (1), 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 14 [2024-10-13 10:50:48,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:50:48,410 INFO L225 Difference]: With dead ends: 88 [2024-10-13 10:50:48,410 INFO L226 Difference]: Without dead ends: 88 [2024-10-13 10:50:48,410 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-10-13 10:50:48,411 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 32 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:50:48,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 274 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:50:48,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-13 10:50:48,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 76. [2024-10-13 10:50:48,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 71 states have internal predecessors, (91), 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-10-13 10:50:48,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 97 transitions. [2024-10-13 10:50:48,415 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 97 transitions. Word has length 14 [2024-10-13 10:50:48,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:50:48,415 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 97 transitions. [2024-10-13 10:50:48,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 1 states have call successors, (1), 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-10-13 10:50:48,415 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 97 transitions. [2024-10-13 10:50:48,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-13 10:50:48,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:50:48,416 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:50:48,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 10:50:48,416 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-13 10:50:48,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:50:48,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1288439037, now seen corresponding path program 1 times [2024-10-13 10:50:48,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:50:48,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141356737] [2024-10-13 10:50:48,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:50:48,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:50:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:50:48,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:50:48,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:50:48,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:50:48,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:50:48,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141356737] [2024-10-13 10:50:48,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141356737] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:50:48,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:50:48,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:50:48,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192137602] [2024-10-13 10:50:48,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:50:48,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:50:48,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:50:48,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:50:48,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:50:48,475 INFO L87 Difference]: Start difference. First operand 76 states and 97 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:50:48,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:50:48,563 INFO L93 Difference]: Finished difference Result 80 states and 104 transitions. [2024-10-13 10:50:48,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:50:48,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-10-13 10:50:48,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:50:48,564 INFO L225 Difference]: With dead ends: 80 [2024-10-13 10:50:48,564 INFO L226 Difference]: Without dead ends: 80 [2024-10-13 10:50:48,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:50:48,565 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 1 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:50:48,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 121 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:50:48,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-13 10:50:48,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-10-13 10:50:48,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 52 states have (on average 1.8846153846153846) internal successors, (98), 75 states have internal predecessors, (98), 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-10-13 10:50:48,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 104 transitions. [2024-10-13 10:50:48,574 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 104 transitions. Word has length 15 [2024-10-13 10:50:48,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:50:48,574 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 104 transitions. [2024-10-13 10:50:48,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:50:48,575 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 104 transitions. [2024-10-13 10:50:48,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-13 10:50:48,575 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:50:48,575 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:50:48,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 10:50:48,575 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-13 10:50:48,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:50:48,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1288439036, now seen corresponding path program 1 times [2024-10-13 10:50:48,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:50:48,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121129261] [2024-10-13 10:50:48,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:50:48,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:50:48,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:50:48,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:50:48,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:50:48,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:50:48,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:50:48,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121129261] [2024-10-13 10:50:48,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121129261] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:50:48,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:50:48,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 10:50:48,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713438168] [2024-10-13 10:50:48,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:50:48,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 10:50:48,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:50:48,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 10:50:48,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-13 10:50:48,917 INFO L87 Difference]: Start difference. First operand 80 states and 104 transitions. Second operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 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-10-13 10:50:49,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:50:49,086 INFO L93 Difference]: Finished difference Result 84 states and 109 transitions. [2024-10-13 10:50:49,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:50:49,087 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 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-10-13 10:50:49,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:50:49,087 INFO L225 Difference]: With dead ends: 84 [2024-10-13 10:50:49,087 INFO L226 Difference]: Without dead ends: 84 [2024-10-13 10:50:49,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-13 10:50:49,088 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 5 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:50:49,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 234 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:50:49,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-13 10:50:49,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-13 10:50:49,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 56 states have (on average 1.8392857142857142) internal successors, (103), 79 states have internal predecessors, (103), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 10:50:49,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 109 transitions. [2024-10-13 10:50:49,100 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 109 transitions. Word has length 15 [2024-10-13 10:50:49,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:50:49,100 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 109 transitions. [2024-10-13 10:50:49,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 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-10-13 10:50:49,100 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 109 transitions. [2024-10-13 10:50:49,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-13 10:50:49,102 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:50:49,102 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:50:49,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 10:50:49,102 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-13 10:50:49,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:50:49,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1287019437, now seen corresponding path program 1 times [2024-10-13 10:50:49,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:50:49,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567435835] [2024-10-13 10:50:49,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:50:49,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:50:49,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:50:49,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:50:49,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:50:49,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:50:49,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:50:49,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567435835] [2024-10-13 10:50:49,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567435835] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:50:49,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:50:49,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 10:50:49,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868281675] [2024-10-13 10:50:49,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:50:49,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:50:49,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:50:49,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:50:49,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:50:49,207 INFO L87 Difference]: Start difference. First operand 84 states and 109 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 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-10-13 10:50:49,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:50:49,292 INFO L93 Difference]: Finished difference Result 85 states and 106 transitions. [2024-10-13 10:50:49,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:50:49,292 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 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 16 [2024-10-13 10:50:49,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:50:49,293 INFO L225 Difference]: With dead ends: 85 [2024-10-13 10:50:49,293 INFO L226 Difference]: Without dead ends: 85 [2024-10-13 10:50:49,294 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-10-13 10:50:49,294 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 20 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:50:49,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 286 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:50:49,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-13 10:50:49,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2024-10-13 10:50:49,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 56 states have (on average 1.7857142857142858) internal successors, (100), 79 states have internal predecessors, (100), 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-10-13 10:50:49,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 106 transitions. [2024-10-13 10:50:49,301 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 106 transitions. Word has length 16 [2024-10-13 10:50:49,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:50:49,301 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 106 transitions. [2024-10-13 10:50:49,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 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-10-13 10:50:49,301 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 106 transitions. [2024-10-13 10:50:49,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 10:50:49,301 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:50:49,301 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:50:49,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 10:50:49,302 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-13 10:50:49,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:50:49,302 INFO L85 PathProgramCache]: Analyzing trace with hash 239755371, now seen corresponding path program 1 times [2024-10-13 10:50:49,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:50:49,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365836915] [2024-10-13 10:50:49,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:50:49,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:50:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:50:49,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:50:49,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:50:49,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 10:50:49,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:50:49,409 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:50:49,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:50:49,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365836915] [2024-10-13 10:50:49,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365836915] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:50:49,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:50:49,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:50:49,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774984093] [2024-10-13 10:50:49,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:50:49,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:50:49,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:50:49,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:50:49,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:50:49,411 INFO L87 Difference]: Start difference. First operand 84 states and 106 transitions. Second operand has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:50:49,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:50:49,483 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2024-10-13 10:50:49,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:50:49,483 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2024-10-13 10:50:49,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:50:49,484 INFO L225 Difference]: With dead ends: 84 [2024-10-13 10:50:49,484 INFO L226 Difference]: Without dead ends: 84 [2024-10-13 10:50:49,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:50:49,485 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 10 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:50:49,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 90 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:50:49,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-13 10:50:49,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-13 10:50:49,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 56 states have (on average 1.7678571428571428) internal successors, (99), 79 states have internal predecessors, (99), 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-10-13 10:50:49,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 105 transitions. [2024-10-13 10:50:49,488 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 105 transitions. Word has length 17 [2024-10-13 10:50:49,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:50:49,489 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 105 transitions. [2024-10-13 10:50:49,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:50:49,489 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 105 transitions. [2024-10-13 10:50:49,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 10:50:49,489 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:50:49,489 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:50:49,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 10:50:49,490 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-13 10:50:49,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:50:49,490 INFO L85 PathProgramCache]: Analyzing trace with hash 239755372, now seen corresponding path program 1 times [2024-10-13 10:50:49,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:50:49,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035050237] [2024-10-13 10:50:49,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:50:49,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:50:49,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:50:49,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:50:49,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:50:49,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 10:50:49,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:50:49,837 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:50:49,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:50:49,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035050237] [2024-10-13 10:50:49,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035050237] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:50:49,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977244558] [2024-10-13 10:50:49,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:50:49,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:50:49,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:50:49,839 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-10-13 10:50:49,840 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-10-13 10:50:49,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:50:49,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-13 10:50:49,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:50:50,015 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-10-13 10:50:50,017 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-10-13 10:50:50,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:50:50,094 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-10-13 10:50:50,107 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:50:50,107 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-10-13 10:50:50,195 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-10-13 10:50:50,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:50:50,226 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-10-13 10:50:50,232 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:50:50,232 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-10-13 10:50:50,235 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-10-13 10:50:50,235 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:50:50,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977244558] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:50:50,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:50:50,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2024-10-13 10:50:50,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798467935] [2024-10-13 10:50:50,352 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:50:50,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-13 10:50:50,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:50:50,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-13 10:50:50,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=321, Unknown=1, NotChecked=36, Total=420 [2024-10-13 10:50:50,353 INFO L87 Difference]: Start difference. First operand 84 states and 105 transitions. Second operand has 19 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 10:50:50,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:50:50,617 INFO L93 Difference]: Finished difference Result 88 states and 101 transitions. [2024-10-13 10:50:50,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:50:50,618 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 17 [2024-10-13 10:50:50,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:50:50,619 INFO L225 Difference]: With dead ends: 88 [2024-10-13 10:50:50,619 INFO L226 Difference]: Without dead ends: 88 [2024-10-13 10:50:50,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=391, Unknown=1, NotChecked=40, Total=506 [2024-10-13 10:50:50,619 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 10 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:50:50,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 231 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 325 Invalid, 0 Unknown, 76 Unchecked, 0.2s Time] [2024-10-13 10:50:50,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-13 10:50:50,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2024-10-13 10:50:50,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 56 states have (on average 1.6964285714285714) internal successors, (95), 79 states have internal predecessors, (95), 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-10-13 10:50:50,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 101 transitions. [2024-10-13 10:50:50,622 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 101 transitions. Word has length 17 [2024-10-13 10:50:50,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:50:50,622 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 101 transitions. [2024-10-13 10:50:50,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 10:50:50,622 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 101 transitions. [2024-10-13 10:50:50,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-13 10:50:50,623 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:50:50,623 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:50:50,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 10:50:50,827 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-10-13 10:50:50,828 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-13 10:50:50,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:50:50,828 INFO L85 PathProgramCache]: Analyzing trace with hash 237319682, now seen corresponding path program 1 times [2024-10-13 10:50:50,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:50:50,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725984545] [2024-10-13 10:50:50,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:50:50,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:50:50,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:50:51,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:50:51,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:50:51,230 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:50:51,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:50:51,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725984545] [2024-10-13 10:50:51,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725984545] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:50:51,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924081164] [2024-10-13 10:50:51,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:50:51,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:50:51,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:50:51,233 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-10-13 10:50:51,234 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-10-13 10:50:51,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:50:51,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-13 10:50:51,313 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:50:51,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-10-13 10:50:51,335 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-10-13 10:50:51,341 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-10-13 10:50:51,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-13 10:50:51,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-13 10:50:51,409 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:50:51,409 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-10-13 10:50:51,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-13 10:50:51,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-13 10:50:51,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:50:51,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-13 10:50:51,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:50:51,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-13 10:50:51,588 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:50:51,588 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:50:52,154 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:50:52,154 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 27 treesize of output 33 [2024-10-13 10:50:52,163 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:50:52,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 32 [2024-10-13 10:50:52,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 10:50:52,197 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:50:52,198 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 27 treesize of output 33 [2024-10-13 10:50:52,201 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:50:52,207 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-13 10:50:52,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 11 [2024-10-13 10:50:55,725 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:50:55,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924081164] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:50:55,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:50:55,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 28 [2024-10-13 10:50:55,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939031263] [2024-10-13 10:50:55,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:50:55,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-13 10:50:55,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:50:55,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-13 10:50:55,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=662, Unknown=3, NotChecked=0, Total=756 [2024-10-13 10:50:55,727 INFO L87 Difference]: Start difference. First operand 84 states and 101 transitions. Second operand has 28 states, 25 states have (on average 1.56) internal successors, (39), 24 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:50:56,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:50:56,206 INFO L93 Difference]: Finished difference Result 85 states and 102 transitions. [2024-10-13 10:50:56,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:50:56,206 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 1.56) internal successors, (39), 24 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 18 [2024-10-13 10:50:56,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:50:56,207 INFO L225 Difference]: With dead ends: 85 [2024-10-13 10:50:56,207 INFO L226 Difference]: Without dead ends: 85 [2024-10-13 10:50:56,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=108, Invalid=759, Unknown=3, NotChecked=0, Total=870 [2024-10-13 10:50:56,208 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 15 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:50:56,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 692 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 10:50:56,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-13 10:50:56,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-10-13 10:50:56,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 57 states have (on average 1.6842105263157894) internal successors, (96), 80 states have internal predecessors, (96), 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-10-13 10:50:56,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 102 transitions. [2024-10-13 10:50:56,210 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 102 transitions. Word has length 18 [2024-10-13 10:50:56,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:50:56,210 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 102 transitions. [2024-10-13 10:50:56,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 1.56) internal successors, (39), 24 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:50:56,210 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 102 transitions. [2024-10-13 10:50:56,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 10:50:56,211 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:50:56,211 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:50:56,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 10:50:56,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-13 10:50:56,412 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-13 10:50:56,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:50:56,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1523227119, now seen corresponding path program 1 times [2024-10-13 10:50:56,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:50:56,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109156396] [2024-10-13 10:50:56,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:50:56,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:50:56,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:50:56,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:50:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:50:56,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 10:50:56,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:50:56,517 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 10:50:56,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:50:56,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109156396] [2024-10-13 10:50:56,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109156396] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:50:56,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:50:56,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 10:50:56,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117372886] [2024-10-13 10:50:56,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:50:56,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:50:56,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:50:56,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:50:56,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:50:56,519 INFO L87 Difference]: Start difference. First operand 85 states and 102 transitions. Second operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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-10-13 10:50:56,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:50:56,644 INFO L93 Difference]: Finished difference Result 84 states and 100 transitions. [2024-10-13 10:50:56,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:50:56,644 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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 19 [2024-10-13 10:50:56,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:50:56,645 INFO L225 Difference]: With dead ends: 84 [2024-10-13 10:50:56,645 INFO L226 Difference]: Without dead ends: 84 [2024-10-13 10:50:56,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-13 10:50:56,645 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:50:56,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 197 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:50:56,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-13 10:50:56,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-13 10:50:56,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 57 states have (on average 1.6491228070175439) internal successors, (94), 79 states have internal predecessors, (94), 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-10-13 10:50:56,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 100 transitions. [2024-10-13 10:50:56,648 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 100 transitions. Word has length 19 [2024-10-13 10:50:56,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:50:56,648 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 100 transitions. [2024-10-13 10:50:56,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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-10-13 10:50:56,648 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 100 transitions. [2024-10-13 10:50:56,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 10:50:56,650 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:50:56,650 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:50:56,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 10:50:56,651 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-13 10:50:56,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:50:56,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1523227118, now seen corresponding path program 1 times [2024-10-13 10:50:56,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:50:56,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922648780] [2024-10-13 10:50:56,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:50:56,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:50:56,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:50:56,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:50:56,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:50:56,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 10:50:56,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:50:56,856 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:50:56,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:50:56,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922648780] [2024-10-13 10:50:56,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922648780] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:50:56,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:50:56,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 10:50:56,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782438717] [2024-10-13 10:50:56,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:50:56,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:50:56,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:50:56,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:50:56,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:50:56,862 INFO L87 Difference]: Start difference. First operand 84 states and 100 transitions. Second operand has 8 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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-10-13 10:50:56,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:50:56,990 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2024-10-13 10:50:56,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:50:56,991 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 19 [2024-10-13 10:50:56,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:50:56,991 INFO L225 Difference]: With dead ends: 83 [2024-10-13 10:50:56,991 INFO L226 Difference]: Without dead ends: 83 [2024-10-13 10:50:56,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-13 10:50:56,992 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 3 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:50:56,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 222 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:50:56,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-13 10:50:56,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-10-13 10:50:56,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 57 states have (on average 1.6140350877192982) internal successors, (92), 78 states have internal predecessors, (92), 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-10-13 10:50:56,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 98 transitions. [2024-10-13 10:50:56,994 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 98 transitions. Word has length 19 [2024-10-13 10:50:56,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:50:56,994 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 98 transitions. [2024-10-13 10:50:56,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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-10-13 10:50:56,995 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 98 transitions. [2024-10-13 10:50:56,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 10:50:56,995 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:50:56,995 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:50:56,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 10:50:56,995 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-13 10:50:56,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:50:56,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1233139404, now seen corresponding path program 1 times [2024-10-13 10:50:56,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:50:56,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077760534] [2024-10-13 10:50:56,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:50:56,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:50:57,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:50:57,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:50:57,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:50:57,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:50:57,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:50:57,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077760534] [2024-10-13 10:50:57,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077760534] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:50:57,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496406405] [2024-10-13 10:50:57,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:50:57,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:50:57,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:50:57,074 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-10-13 10:50:57,075 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-10-13 10:50:57,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:50:57,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-13 10:50:57,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:50:57,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:50:57,182 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:50:57,194 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-13 10:50:57,194 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 12 treesize of output 11 [2024-10-13 10:50:57,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:50:57,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496406405] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:50:57,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:50:57,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2024-10-13 10:50:57,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703320280] [2024-10-13 10:50:57,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:50:57,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:50:57,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:50:57,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:50:57,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:50:57,205 INFO L87 Difference]: Start difference. First operand 83 states and 98 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:50:57,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:50:57,327 INFO L93 Difference]: Finished difference Result 84 states and 100 transitions. [2024-10-13 10:50:57,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 10:50:57,327 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-10-13 10:50:57,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:50:57,328 INFO L225 Difference]: With dead ends: 84 [2024-10-13 10:50:57,328 INFO L226 Difference]: Without dead ends: 84 [2024-10-13 10:50:57,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:50:57,328 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 27 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:50:57,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 133 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:50:57,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-13 10:50:57,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2024-10-13 10:50:57,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 59 states have (on average 1.5932203389830508) internal successors, (94), 78 states have internal predecessors, (94), 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-10-13 10:50:57,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 100 transitions. [2024-10-13 10:50:57,331 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 100 transitions. Word has length 19 [2024-10-13 10:50:57,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:50:57,331 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 100 transitions. [2024-10-13 10:50:57,331 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:50:57,331 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 100 transitions. [2024-10-13 10:50:57,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 10:50:57,332 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:50:57,332 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:50:57,346 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-10-13 10:50:57,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:50:57,537 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-13 10:50:57,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:50:57,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1233139403, now seen corresponding path program 1 times [2024-10-13 10:50:57,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:50:57,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232672831] [2024-10-13 10:50:57,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:50:57,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:50:57,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:50:57,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:50:57,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:50:57,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:50:57,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:50:57,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232672831] [2024-10-13 10:50:57,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232672831] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:50:57,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251229721] [2024-10-13 10:50:57,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:50:57,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:50:57,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:50:57,684 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-10-13 10:50:57,685 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-10-13 10:50:57,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:50:57,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-13 10:50:57,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:50:57,794 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-10-13 10:50:57,800 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-10-13 10:50:57,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:50:57,863 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-10-13 10:50:57,871 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:50:57,872 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-10-13 10:50:57,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:50:57,964 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:50:58,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:50:58,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251229721] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 10:50:58,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:50:58,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 8] total 23 [2024-10-13 10:50:58,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335747180] [2024-10-13 10:50:58,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:50:58,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 10:50:58,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:50:58,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 10:50:58,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2024-10-13 10:50:58,238 INFO L87 Difference]: Start difference. First operand 83 states and 100 transitions. Second operand has 9 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:50:58,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:50:58,422 INFO L93 Difference]: Finished difference Result 91 states and 115 transitions. [2024-10-13 10:50:58,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 10:50:58,422 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-10-13 10:50:58,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:50:58,423 INFO L225 Difference]: With dead ends: 91 [2024-10-13 10:50:58,423 INFO L226 Difference]: Without dead ends: 91 [2024-10-13 10:50:58,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2024-10-13 10:50:58,424 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 11 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:50:58,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 128 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:50:58,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-13 10:50:58,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2024-10-13 10:50:58,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 62 states have (on average 1.5806451612903225) internal successors, (98), 81 states have internal predecessors, (98), 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-10-13 10:50:58,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 104 transitions. [2024-10-13 10:50:58,426 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 104 transitions. Word has length 19 [2024-10-13 10:50:58,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:50:58,426 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 104 transitions. [2024-10-13 10:50:58,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:50:58,427 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 104 transitions. [2024-10-13 10:50:58,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-13 10:50:58,427 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:50:58,427 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] [2024-10-13 10:50:58,441 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-10-13 10:50:58,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-13 10:50:58,632 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-13 10:50:58,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:50:58,632 INFO L85 PathProgramCache]: Analyzing trace with hash 427395377, now seen corresponding path program 1 times [2024-10-13 10:50:58,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:50:58,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434530173] [2024-10-13 10:50:58,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:50:58,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:50:58,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:50:58,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:50:58,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:50:58,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:50:58,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:50:58,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434530173] [2024-10-13 10:50:58,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434530173] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:50:58,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:50:58,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 10:50:58,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811187092] [2024-10-13 10:50:58,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:50:58,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 10:50:58,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:50:58,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 10:50:58,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-13 10:50:58,714 INFO L87 Difference]: Start difference. First operand 86 states and 104 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 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-10-13 10:50:58,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:50:58,818 INFO L93 Difference]: Finished difference Result 90 states and 107 transitions. [2024-10-13 10:50:58,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 10:50:58,819 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 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 20 [2024-10-13 10:50:58,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:50:58,819 INFO L225 Difference]: With dead ends: 90 [2024-10-13 10:50:58,819 INFO L226 Difference]: Without dead ends: 90 [2024-10-13 10:50:58,819 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-10-13 10:50:58,820 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 31 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:50:58,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 224 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:50:58,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-13 10:50:58,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 85. [2024-10-13 10:50:58,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 61 states have (on average 1.5245901639344261) internal successors, (93), 80 states have internal predecessors, (93), 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-10-13 10:50:58,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2024-10-13 10:50:58,822 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 20 [2024-10-13 10:50:58,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:50:58,822 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2024-10-13 10:50:58,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 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-10-13 10:50:58,823 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2024-10-13 10:50:58,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-13 10:50:58,823 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:50:58,823 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] [2024-10-13 10:50:58,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 10:50:58,823 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-13 10:50:58,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:50:58,824 INFO L85 PathProgramCache]: Analyzing trace with hash 427384198, now seen corresponding path program 1 times [2024-10-13 10:50:58,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:50:58,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737329498] [2024-10-13 10:50:58,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:50:58,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:50:58,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:50:58,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:50:58,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:50:58,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:50:58,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:50:58,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737329498] [2024-10-13 10:50:58,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737329498] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:50:58,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:50:58,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 10:50:58,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031779396] [2024-10-13 10:50:58,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:50:58,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:50:58,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:50:58,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:50:58,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:50:58,929 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 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-10-13 10:50:59,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:50:59,073 INFO L93 Difference]: Finished difference Result 95 states and 110 transitions. [2024-10-13 10:50:59,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:50:59,073 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 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 20 [2024-10-13 10:50:59,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:50:59,074 INFO L225 Difference]: With dead ends: 95 [2024-10-13 10:50:59,074 INFO L226 Difference]: Without dead ends: 95 [2024-10-13 10:50:59,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:50:59,074 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 20 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:50:59,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 197 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:50:59,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-13 10:50:59,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 86. [2024-10-13 10:50:59,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 62 states have (on average 1.5161290322580645) internal successors, (94), 81 states have internal predecessors, (94), 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-10-13 10:50:59,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 100 transitions. [2024-10-13 10:50:59,076 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 100 transitions. Word has length 20 [2024-10-13 10:50:59,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:50:59,076 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 100 transitions. [2024-10-13 10:50:59,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 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-10-13 10:50:59,077 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 100 transitions. [2024-10-13 10:50:59,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-13 10:50:59,077 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:50:59,077 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:50:59,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 10:50:59,077 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-13 10:50:59,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:50:59,078 INFO L85 PathProgramCache]: Analyzing trace with hash 762676370, now seen corresponding path program 1 times [2024-10-13 10:50:59,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:50:59,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515226675] [2024-10-13 10:50:59,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:50:59,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:50:59,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:50:59,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:50:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:50:59,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 10:50:59,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:50:59,387 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:50:59,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:50:59,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515226675] [2024-10-13 10:50:59,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515226675] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:50:59,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:50:59,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 10:50:59,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498650219] [2024-10-13 10:50:59,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:50:59,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 10:50:59,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:50:59,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 10:50:59,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-13 10:50:59,390 INFO L87 Difference]: Start difference. First operand 86 states and 100 transitions. Second operand has 11 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:50:59,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:50:59,603 INFO L93 Difference]: Finished difference Result 87 states and 99 transitions. [2024-10-13 10:50:59,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:50:59,603 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2024-10-13 10:50:59,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:50:59,604 INFO L225 Difference]: With dead ends: 87 [2024-10-13 10:50:59,604 INFO L226 Difference]: Without dead ends: 87 [2024-10-13 10:50:59,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-10-13 10:50:59,604 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 15 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:50:59,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 268 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:50:59,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-13 10:50:59,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2024-10-13 10:50:59,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 62 states have (on average 1.5) internal successors, (93), 81 states have internal predecessors, (93), 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-10-13 10:50:59,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2024-10-13 10:50:59,607 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 21 [2024-10-13 10:50:59,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:50:59,608 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2024-10-13 10:50:59,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:50:59,608 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2024-10-13 10:50:59,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-13 10:50:59,608 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:50:59,608 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:50:59,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-13 10:50:59,608 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-13 10:50:59,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:50:59,609 INFO L85 PathProgramCache]: Analyzing trace with hash 762676369, now seen corresponding path program 1 times [2024-10-13 10:50:59,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:50:59,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681823188] [2024-10-13 10:50:59,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:50:59,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:50:59,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:50:59,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:50:59,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:50:59,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 10:50:59,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:50:59,821 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:50:59,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:50:59,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681823188] [2024-10-13 10:50:59,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681823188] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:50:59,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:50:59,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 10:50:59,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143322805] [2024-10-13 10:50:59,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:50:59,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 10:50:59,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:50:59,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 10:50:59,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-13 10:50:59,823 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:51:00,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:51:00,018 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2024-10-13 10:51:00,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:51:00,019 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2024-10-13 10:51:00,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:51:00,020 INFO L225 Difference]: With dead ends: 86 [2024-10-13 10:51:00,021 INFO L226 Difference]: Without dead ends: 86 [2024-10-13 10:51:00,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-10-13 10:51:00,021 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 14 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:51:00,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 259 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:51:00,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-13 10:51:00,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-13 10:51:00,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 62 states have (on average 1.4838709677419355) internal successors, (92), 81 states have internal predecessors, (92), 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-10-13 10:51:00,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2024-10-13 10:51:00,024 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 21 [2024-10-13 10:51:00,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:51:00,024 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2024-10-13 10:51:00,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:51:00,025 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2024-10-13 10:51:00,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-13 10:51:00,025 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:51:00,025 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] [2024-10-13 10:51:00,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-13 10:51:00,025 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-13 10:51:00,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:51:00,026 INFO L85 PathProgramCache]: Analyzing trace with hash 364008372, now seen corresponding path program 1 times [2024-10-13 10:51:00,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:51:00,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144197244] [2024-10-13 10:51:00,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:51:00,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:51:00,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:00,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:51:00,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:00,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:51:00,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:51:00,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144197244] [2024-10-13 10:51:00,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144197244] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:51:00,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:51:00,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 10:51:00,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5082250] [2024-10-13 10:51:00,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:51:00,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:51:00,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:51:00,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:51:00,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:51:00,130 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:51:00,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:51:00,276 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2024-10-13 10:51:00,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 10:51:00,276 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-10-13 10:51:00,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:51:00,277 INFO L225 Difference]: With dead ends: 92 [2024-10-13 10:51:00,277 INFO L226 Difference]: Without dead ends: 92 [2024-10-13 10:51:00,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:51:00,277 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 18 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:51:00,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 164 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:51:00,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-13 10:51:00,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 87. [2024-10-13 10:51:00,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 63 states have (on average 1.4761904761904763) internal successors, (93), 82 states have internal predecessors, (93), 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-10-13 10:51:00,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 99 transitions. [2024-10-13 10:51:00,279 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 99 transitions. Word has length 21 [2024-10-13 10:51:00,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:51:00,279 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 99 transitions. [2024-10-13 10:51:00,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:51:00,279 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 99 transitions. [2024-10-13 10:51:00,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-13 10:51:00,280 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:51:00,280 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-10-13 10:51:00,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-13 10:51:00,280 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-13 10:51:00,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:51:00,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1600642232, now seen corresponding path program 1 times [2024-10-13 10:51:00,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:51:00,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575726207] [2024-10-13 10:51:00,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:51:00,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:51:00,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:00,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:51:00,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:00,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:51:00,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:51:00,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575726207] [2024-10-13 10:51:00,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575726207] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:51:00,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:51:00,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 10:51:00,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657700079] [2024-10-13 10:51:00,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:51:00,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 10:51:00,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:51:00,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 10:51:00,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-13 10:51:00,392 INFO L87 Difference]: Start difference. First operand 87 states and 99 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-10-13 10:51:00,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:51:00,540 INFO L93 Difference]: Finished difference Result 88 states and 100 transitions. [2024-10-13 10:51:00,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 10:51:00,541 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-10-13 10:51:00,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:51:00,541 INFO L225 Difference]: With dead ends: 88 [2024-10-13 10:51:00,541 INFO L226 Difference]: Without dead ends: 88 [2024-10-13 10:51:00,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-13 10:51:00,544 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 13 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:51:00,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 206 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:51:00,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-13 10:51:00,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-13 10:51:00,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 64 states have (on average 1.46875) internal successors, (94), 83 states have internal predecessors, (94), 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-10-13 10:51:00,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 100 transitions. [2024-10-13 10:51:00,546 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 100 transitions. Word has length 22 [2024-10-13 10:51:00,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:51:00,546 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 100 transitions. [2024-10-13 10:51:00,546 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-10-13 10:51:00,546 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 100 transitions. [2024-10-13 10:51:00,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-13 10:51:00,547 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:51:00,547 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-10-13 10:51:00,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-13 10:51:00,547 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-13 10:51:00,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:51:00,548 INFO L85 PathProgramCache]: Analyzing trace with hash -618888661, now seen corresponding path program 1 times [2024-10-13 10:51:00,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:51:00,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774938031] [2024-10-13 10:51:00,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:51:00,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:51:00,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:00,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:51:00,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:00,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:51:00,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:51:00,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774938031] [2024-10-13 10:51:00,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774938031] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:51:00,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:51:00,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 10:51:00,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30599872] [2024-10-13 10:51:00,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:51:00,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 10:51:00,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:51:00,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 10:51:00,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-10-13 10:51:00,738 INFO L87 Difference]: Start difference. First operand 88 states and 100 transitions. Second operand has 12 states, 10 states have (on average 2.2) internal successors, (22), 10 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-10-13 10:51:00,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:51:00,928 INFO L93 Difference]: Finished difference Result 91 states and 105 transitions. [2024-10-13 10:51:00,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 10:51:00,928 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.2) internal successors, (22), 10 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-10-13 10:51:00,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:51:00,929 INFO L225 Difference]: With dead ends: 91 [2024-10-13 10:51:00,929 INFO L226 Difference]: Without dead ends: 91 [2024-10-13 10:51:00,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-10-13 10:51:00,929 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 25 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:51:00,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 188 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:51:00,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-13 10:51:00,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2024-10-13 10:51:00,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 66 states have (on average 1.4696969696969697) internal successors, (97), 85 states have internal predecessors, (97), 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-10-13 10:51:00,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2024-10-13 10:51:00,931 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 24 [2024-10-13 10:51:00,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:51:00,931 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2024-10-13 10:51:00,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.2) internal successors, (22), 10 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-10-13 10:51:00,931 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2024-10-13 10:51:00,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-13 10:51:00,932 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:51:00,932 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-10-13 10:51:00,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-13 10:51:00,932 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-13 10:51:00,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:51:00,932 INFO L85 PathProgramCache]: Analyzing trace with hash -618888660, now seen corresponding path program 1 times [2024-10-13 10:51:00,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:51:00,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174848647] [2024-10-13 10:51:00,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:51:00,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:51:00,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:01,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:51:01,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:01,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:51:01,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:51:01,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174848647] [2024-10-13 10:51:01,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174848647] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:51:01,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857321136] [2024-10-13 10:51:01,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:51:01,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:51:01,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:51:01,103 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-10-13 10:51:01,123 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-10-13 10:51:01,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:01,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-13 10:51:01,224 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:51:01,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:51:01,297 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:51:01,371 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:51:01,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2024-10-13 10:51:01,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:51:01,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857321136] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:51:01,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:51:01,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 18 [2024-10-13 10:51:01,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065315425] [2024-10-13 10:51:01,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:51:01,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-13 10:51:01,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:51:01,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-13 10:51:01,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2024-10-13 10:51:01,413 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand has 19 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:51:01,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:51:01,649 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2024-10-13 10:51:01,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 10:51:01,649 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-10-13 10:51:01,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:51:01,650 INFO L225 Difference]: With dead ends: 93 [2024-10-13 10:51:01,650 INFO L226 Difference]: Without dead ends: 93 [2024-10-13 10:51:01,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2024-10-13 10:51:01,651 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 35 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:51:01,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 328 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:51:01,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-13 10:51:01,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2024-10-13 10:51:01,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 68 states have (on average 1.4411764705882353) internal successors, (98), 86 states have internal predecessors, (98), 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-10-13 10:51:01,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2024-10-13 10:51:01,653 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 24 [2024-10-13 10:51:01,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:51:01,653 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2024-10-13 10:51:01,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:51:01,653 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2024-10-13 10:51:01,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 10:51:01,653 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:51:01,653 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-10-13 10:51:01,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-13 10:51:01,857 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,SelfDestructingSolverStorable25 [2024-10-13 10:51:01,858 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-13 10:51:01,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:51:01,858 INFO L85 PathProgramCache]: Analyzing trace with hash -2046483990, now seen corresponding path program 1 times [2024-10-13 10:51:01,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:51:01,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120377413] [2024-10-13 10:51:01,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:51:01,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:51:01,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:01,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:51:01,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:01,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:51:01,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:51:01,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120377413] [2024-10-13 10:51:01,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120377413] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:51:01,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:51:01,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 10:51:01,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307977897] [2024-10-13 10:51:01,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:51:01,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 10:51:01,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:51:01,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 10:51:01,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-13 10:51:01,958 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand has 9 states, 7 states have (on average 3.4285714285714284) 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-10-13 10:51:02,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:51:02,075 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2024-10-13 10:51:02,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 10:51:02,075 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.4285714285714284) 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-10-13 10:51:02,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:51:02,076 INFO L225 Difference]: With dead ends: 92 [2024-10-13 10:51:02,076 INFO L226 Difference]: Without dead ends: 92 [2024-10-13 10:51:02,076 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-10-13 10:51:02,076 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 22 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:51:02,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 206 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:51:02,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-13 10:51:02,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-13 10:51:02,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 69 states have (on average 1.434782608695652) internal successors, (99), 87 states have internal predecessors, (99), 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-10-13 10:51:02,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2024-10-13 10:51:02,079 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 26 [2024-10-13 10:51:02,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:51:02,079 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2024-10-13 10:51:02,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.4285714285714284) 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-10-13 10:51:02,080 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2024-10-13 10:51:02,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-13 10:51:02,081 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:51:02,081 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:51:02,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-13 10:51:02,082 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-13 10:51:02,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:51:02,082 INFO L85 PathProgramCache]: Analyzing trace with hash -755062877, now seen corresponding path program 1 times [2024-10-13 10:51:02,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:51:02,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747390028] [2024-10-13 10:51:02,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:51:02,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:51:02,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:02,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:51:02,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:02,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 10:51:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:02,469 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:51:02,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:51:02,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747390028] [2024-10-13 10:51:02,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747390028] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:51:02,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356777413] [2024-10-13 10:51:02,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:51:02,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:51:02,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:51:02,471 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-10-13 10:51:02,473 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-10-13 10:51:02,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:02,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-13 10:51:02,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:51:02,705 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 10:51:02,705 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:51:02,809 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:51:02,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2024-10-13 10:51:02,879 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 10:51:02,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356777413] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:51:02,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:51:02,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5, 5] total 21 [2024-10-13 10:51:02,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383765447] [2024-10-13 10:51:02,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:51:02,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-13 10:51:02,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:51:02,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-13 10:51:02,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2024-10-13 10:51:02,882 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand has 22 states, 19 states have (on average 3.210526315789474) internal successors, (61), 20 states have internal predecessors, (61), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-13 10:51:03,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:51:03,158 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2024-10-13 10:51:03,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:51:03,161 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 3.210526315789474) internal successors, (61), 20 states have internal predecessors, (61), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 28 [2024-10-13 10:51:03,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:51:03,162 INFO L225 Difference]: With dead ends: 93 [2024-10-13 10:51:03,162 INFO L226 Difference]: Without dead ends: 93 [2024-10-13 10:51:03,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2024-10-13 10:51:03,163 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 20 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:51:03,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 349 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:51:03,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-13 10:51:03,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2024-10-13 10:51:03,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 69 states have (on average 1.4202898550724639) internal successors, (98), 87 states have internal predecessors, (98), 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-10-13 10:51:03,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2024-10-13 10:51:03,165 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 28 [2024-10-13 10:51:03,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:51:03,165 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2024-10-13 10:51:03,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 3.210526315789474) internal successors, (61), 20 states have internal predecessors, (61), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-13 10:51:03,165 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2024-10-13 10:51:03,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-13 10:51:03,165 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:51:03,165 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:51:03,183 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-10-13 10:51:03,365 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,SelfDestructingSolverStorable27 [2024-10-13 10:51:03,366 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-13 10:51:03,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:51:03,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1713135946, now seen corresponding path program 1 times [2024-10-13 10:51:03,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:51:03,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754282135] [2024-10-13 10:51:03,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:51:03,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:51:03,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:03,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:51:03,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:03,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 10:51:03,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:03,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 10:51:03,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:03,750 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 10:51:03,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:51:03,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754282135] [2024-10-13 10:51:03,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754282135] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:51:03,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275761130] [2024-10-13 10:51:03,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:51:03,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:51:03,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:51:03,752 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-10-13 10:51:03,753 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-10-13 10:51:03,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:03,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-13 10:51:03,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:51:03,928 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:51:03,929 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-10-13 10:51:03,945 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-10-13 10:51:03,980 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-13 10:51:03,980 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-10-13 10:51:04,012 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-13 10:51:04,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-10-13 10:51:04,020 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-10-13 10:51:04,031 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-10-13 10:51:04,053 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-13 10:51:04,054 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-10-13 10:51:04,057 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 3 not checked. [2024-10-13 10:51:04,057 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:51:04,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275761130] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:51:04,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:51:04,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 20 [2024-10-13 10:51:04,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268987244] [2024-10-13 10:51:04,094 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:51:04,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-13 10:51:04,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:51:04,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-13 10:51:04,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=362, Unknown=1, NotChecked=38, Total=462 [2024-10-13 10:51:04,095 INFO L87 Difference]: Start difference. First operand 92 states and 104 transitions. Second operand has 21 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-13 10:51:04,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:51:04,371 INFO L93 Difference]: Finished difference Result 90 states and 102 transitions. [2024-10-13 10:51:04,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:51:04,371 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 30 [2024-10-13 10:51:04,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:51:04,372 INFO L225 Difference]: With dead ends: 90 [2024-10-13 10:51:04,372 INFO L226 Difference]: Without dead ends: 90 [2024-10-13 10:51:04,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=600, Unknown=1, NotChecked=50, Total=756 [2024-10-13 10:51:04,372 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 8 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:51:04,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 384 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 401 Invalid, 0 Unknown, 52 Unchecked, 0.2s Time] [2024-10-13 10:51:04,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-13 10:51:04,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-13 10:51:04,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 69 states have (on average 1.391304347826087) internal successors, (96), 85 states have internal predecessors, (96), 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-10-13 10:51:04,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2024-10-13 10:51:04,375 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 30 [2024-10-13 10:51:04,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:51:04,375 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2024-10-13 10:51:04,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-13 10:51:04,375 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2024-10-13 10:51:04,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-13 10:51:04,375 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:51:04,375 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:51:04,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-13 10:51:04,575 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-10-13 10:51:04,576 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-13 10:51:04,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:51:04,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1713135947, now seen corresponding path program 1 times [2024-10-13 10:51:04,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:51:04,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917417550] [2024-10-13 10:51:04,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:51:04,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:51:04,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:04,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:51:04,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:05,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 10:51:05,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:05,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 10:51:05,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:05,155 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 10:51:05,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:51:05,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917417550] [2024-10-13 10:51:05,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917417550] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:51:05,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497160530] [2024-10-13 10:51:05,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:51:05,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:51:05,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:51:05,157 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-10-13 10:51:05,158 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-10-13 10:51:05,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:05,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-10-13 10:51:05,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:51:05,378 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:51:05,378 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-10-13 10:51:05,424 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-10-13 10:51:05,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 10:51:05,485 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-13 10:51:05,486 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 81 treesize of output 74 [2024-10-13 10:51:05,492 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 49 treesize of output 30 [2024-10-13 10:51:05,573 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-13 10:51:05,573 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 81 treesize of output 74 [2024-10-13 10:51:05,578 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 49 treesize of output 30 [2024-10-13 10:51:05,591 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 50 treesize of output 26 [2024-10-13 10:51:05,597 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 32 treesize of output 14 [2024-10-13 10:51:05,661 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-10-13 10:51:05,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:51:05,681 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-10-13 10:51:05,687 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:51:05,687 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-10-13 10:51:05,706 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-10-13 10:51:05,706 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:51:05,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497160530] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:51:05,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:51:05,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2024-10-13 10:51:05,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023928139] [2024-10-13 10:51:05,809 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:51:05,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-13 10:51:05,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:51:05,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-13 10:51:05,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=778, Unknown=1, NotChecked=56, Total=930 [2024-10-13 10:51:05,810 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand has 29 states, 25 states have (on average 1.72) internal successors, (43), 22 states have internal predecessors, (43), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 10:51:06,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:51:06,293 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2024-10-13 10:51:06,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-13 10:51:06,294 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 1.72) internal successors, (43), 22 states have internal predecessors, (43), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 30 [2024-10-13 10:51:06,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:51:06,294 INFO L225 Difference]: With dead ends: 86 [2024-10-13 10:51:06,294 INFO L226 Difference]: Without dead ends: 86 [2024-10-13 10:51:06,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=236, Invalid=1489, Unknown=1, NotChecked=80, Total=1806 [2024-10-13 10:51:06,295 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 25 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:51:06,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 500 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 535 Invalid, 0 Unknown, 60 Unchecked, 0.2s Time] [2024-10-13 10:51:06,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-13 10:51:06,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-13 10:51:06,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 69 states have (on average 1.3333333333333333) internal successors, (92), 81 states have internal predecessors, (92), 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-10-13 10:51:06,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2024-10-13 10:51:06,297 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 30 [2024-10-13 10:51:06,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:51:06,297 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2024-10-13 10:51:06,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 1.72) internal successors, (43), 22 states have internal predecessors, (43), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 10:51:06,298 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2024-10-13 10:51:06,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-13 10:51:06,298 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:51:06,298 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] [2024-10-13 10:51:06,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-13 10:51:06,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:51:06,499 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-13 10:51:06,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:51:06,499 INFO L85 PathProgramCache]: Analyzing trace with hash 256364298, now seen corresponding path program 1 times [2024-10-13 10:51:06,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:51:06,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207709444] [2024-10-13 10:51:06,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:51:06,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:51:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:06,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:51:06,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:06,775 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:51:06,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:51:06,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207709444] [2024-10-13 10:51:06,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207709444] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:51:06,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657286494] [2024-10-13 10:51:06,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:51:06,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:51:06,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:51:06,778 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-10-13 10:51:06,779 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-10-13 10:51:06,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:06,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-10-13 10:51:06,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:51:06,921 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-10-13 10:51:06,925 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-10-13 10:51:06,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-13 10:51:06,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 23 treesize of output 11 [2024-10-13 10:51:07,011 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-13 10:51:07,011 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 16 treesize of output 15 [2024-10-13 10:51:07,024 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-13 10:51:07,024 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 16 treesize of output 15 [2024-10-13 10:51:07,054 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 31 treesize of output 19 [2024-10-13 10:51:07,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2024-10-13 10:51:07,238 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-10-13 10:51:07,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:51:07,295 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:51:07,295 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 49 treesize of output 51 [2024-10-13 10:51:07,303 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:51:07,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 19 [2024-10-13 10:51:07,312 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:51:07,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-13 10:51:07,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:51:07,375 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:51:07,453 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-10-13 10:51:07,653 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_create_~data~0#1.base| Int) (v_ArrVal_2044 (Array Int Int))) (let ((.cse0 (select (let ((.cse1 (store |c_#memory_$Pointer$#0.base| |ULTIMATE.start_create_~data~0#1.base| v_ArrVal_2044))) (store .cse1 |c_ULTIMATE.start_create_~now~0#1.base| (store (select .cse1 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| |ULTIMATE.start_create_~data~0#1.base|))) |c_ULTIMATE.start_create_~dll~0#1.base|))) (or (= |c_ULTIMATE.start_create_~dll~0#1.base| (select .cse0 0)) (= (select .cse0 8) 0)))) (forall ((|ULTIMATE.start_create_~data~0#1.base| Int)) (or (forall ((v_ArrVal_2044 (Array Int Int))) (= |c_ULTIMATE.start_create_~dll~0#1.base| (select (select (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |ULTIMATE.start_create_~data~0#1.base| v_ArrVal_2044))) (store .cse2 |c_ULTIMATE.start_create_~now~0#1.base| (store (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| |ULTIMATE.start_create_~data~0#1.base|))) |c_ULTIMATE.start_create_~dll~0#1.base|) 0))) (forall ((|ULTIMATE.start_create_~data~0#1.offset| Int) (v_ArrVal_2043 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$#0.offset| |ULTIMATE.start_create_~data~0#1.base| v_ArrVal_2043))) (store .cse3 |c_ULTIMATE.start_create_~now~0#1.base| (store (select .cse3 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| |ULTIMATE.start_create_~data~0#1.offset|))) |c_ULTIMATE.start_create_~dll~0#1.base|) 8) 0))))) is different from false [2024-10-13 10:51:07,676 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_create_~data~0#1.base| Int) (v_ArrVal_2044 (Array Int Int))) (let ((.cse0 (store (select (store |c_#memory_$Pointer$#0.base| |ULTIMATE.start_create_~data~0#1.base| v_ArrVal_2044) |c_ULTIMATE.start_create_#t~ret4#1.base|) |c_ULTIMATE.start_create_#t~ret4#1.offset| |ULTIMATE.start_create_~data~0#1.base|))) (or (= (select .cse0 8) 0) (= |c_ULTIMATE.start_create_#t~ret4#1.base| (select .cse0 0))))) (forall ((|ULTIMATE.start_create_~data~0#1.base| Int)) (or (forall ((|ULTIMATE.start_create_~data~0#1.offset| Int) (v_ArrVal_2043 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$#0.offset| |ULTIMATE.start_create_~data~0#1.base| v_ArrVal_2043) |c_ULTIMATE.start_create_#t~ret4#1.base|) |c_ULTIMATE.start_create_#t~ret4#1.offset| |ULTIMATE.start_create_~data~0#1.offset|) 8) 0)) (forall ((v_ArrVal_2044 (Array Int Int))) (= |c_ULTIMATE.start_create_#t~ret4#1.base| (select (store (select (store |c_#memory_$Pointer$#0.base| |ULTIMATE.start_create_~data~0#1.base| v_ArrVal_2044) |c_ULTIMATE.start_create_#t~ret4#1.base|) |c_ULTIMATE.start_create_#t~ret4#1.offset| |ULTIMATE.start_create_~data~0#1.base|) 0)))))) is different from false [2024-10-13 10:51:07,744 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_create_~data~0#1.base| Int) (v_ArrVal_2044 (Array Int Int))) (let ((.cse0 (store (select (store |c_#memory_$Pointer$#0.base| |ULTIMATE.start_create_~data~0#1.base| v_ArrVal_2044) |c_alloc_and_zero_#res.base|) |c_alloc_and_zero_#res.offset| |ULTIMATE.start_create_~data~0#1.base|))) (or (= (select .cse0 8) 0) (= (select .cse0 0) |c_alloc_and_zero_#res.base|)))) (forall ((|ULTIMATE.start_create_~data~0#1.base| Int)) (or (forall ((v_ArrVal_2044 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$#0.base| |ULTIMATE.start_create_~data~0#1.base| v_ArrVal_2044) |c_alloc_and_zero_#res.base|) |c_alloc_and_zero_#res.offset| |ULTIMATE.start_create_~data~0#1.base|) 0) |c_alloc_and_zero_#res.base|)) (forall ((|ULTIMATE.start_create_~data~0#1.offset| Int) (v_ArrVal_2043 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$#0.offset| |ULTIMATE.start_create_~data~0#1.base| v_ArrVal_2043) |c_alloc_and_zero_#res.base|) |c_alloc_and_zero_#res.offset| |ULTIMATE.start_create_~data~0#1.offset|) 8) 0))))) is different from false [2024-10-13 10:51:07,857 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:51:07,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2024-10-13 10:51:07,866 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:51:07,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2024-10-13 10:51:07,873 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 38 treesize of output 34 [2024-10-13 10:51:07,877 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 38 treesize of output 34 [2024-10-13 10:51:07,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-10-13 10:51:07,895 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-13 10:51:07,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 29 [2024-10-13 10:51:07,901 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:51:07,903 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 9 treesize of output 7 [2024-10-13 10:51:07,906 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:51:07,913 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:51:07,913 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-10-13 10:51:07,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:51:07,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657286494] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:51:07,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:51:07,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 16] total 33 [2024-10-13 10:51:07,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436284020] [2024-10-13 10:51:07,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:51:07,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-13 10:51:07,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:51:07,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-13 10:51:07,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=768, Unknown=30, NotChecked=174, Total=1056 [2024-10-13 10:51:07,934 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand has 33 states, 30 states have (on average 2.033333333333333) internal successors, (61), 29 states have internal predecessors, (61), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:51:08,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:51:08,596 INFO L93 Difference]: Finished difference Result 109 states and 127 transitions. [2024-10-13 10:51:08,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-13 10:51:08,597 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 2.033333333333333) internal successors, (61), 29 states have internal predecessors, (61), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2024-10-13 10:51:08,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:51:08,597 INFO L225 Difference]: With dead ends: 109 [2024-10-13 10:51:08,597 INFO L226 Difference]: Without dead ends: 109 [2024-10-13 10:51:08,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=145, Invalid=1311, Unknown=38, NotChecked=228, Total=1722 [2024-10-13 10:51:08,598 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 186 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:51:08,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 450 Invalid, 1134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 944 Invalid, 0 Unknown, 186 Unchecked, 0.4s Time] [2024-10-13 10:51:08,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-13 10:51:08,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 100. [2024-10-13 10:51:08,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 83 states have (on average 1.3493975903614457) internal successors, (112), 95 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 10:51:08,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 118 transitions. [2024-10-13 10:51:08,600 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 118 transitions. Word has length 29 [2024-10-13 10:51:08,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:51:08,600 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 118 transitions. [2024-10-13 10:51:08,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 2.033333333333333) internal successors, (61), 29 states have internal predecessors, (61), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:51:08,600 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 118 transitions. [2024-10-13 10:51:08,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-13 10:51:08,601 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:51:08,601 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:51:08,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-13 10:51:08,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:51:08,801 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-13 10:51:08,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:51:08,802 INFO L85 PathProgramCache]: Analyzing trace with hash -642642783, now seen corresponding path program 1 times [2024-10-13 10:51:08,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:51:08,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019121922] [2024-10-13 10:51:08,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:51:08,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:51:08,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:09,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:51:09,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:09,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:51:09,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:51:09,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019121922] [2024-10-13 10:51:09,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019121922] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:51:09,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668680189] [2024-10-13 10:51:09,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:51:09,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:51:09,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:51:09,158 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-10-13 10:51:09,159 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-10-13 10:51:09,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:09,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-13 10:51:09,292 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:51:09,489 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-10-13 10:51:09,613 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:51:09,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 30 [2024-10-13 10:51:10,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:51:10,125 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:51:10,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2024-10-13 10:51:10,284 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 60 treesize of output 52 [2024-10-13 10:51:10,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668680189] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:51:10,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:51:10,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 25 [2024-10-13 10:51:10,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365099774] [2024-10-13 10:51:10,893 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:51:10,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-13 10:51:10,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:51:10,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-13 10:51:10,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=912, Unknown=2, NotChecked=0, Total=992 [2024-10-13 10:51:10,894 INFO L87 Difference]: Start difference. First operand 100 states and 118 transitions. Second operand has 27 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 22 states have internal predecessors, (55), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:51:12,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:51:12,012 INFO L93 Difference]: Finished difference Result 106 states and 123 transitions. [2024-10-13 10:51:12,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 10:51:12,012 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 22 states have internal predecessors, (55), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-10-13 10:51:12,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:51:12,013 INFO L225 Difference]: With dead ends: 106 [2024-10-13 10:51:12,013 INFO L226 Difference]: Without dead ends: 87 [2024-10-13 10:51:12,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=139, Invalid=1581, Unknown=2, NotChecked=0, Total=1722 [2024-10-13 10:51:12,014 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 24 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 10:51:12,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 321 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 731 Invalid, 1 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 10:51:12,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-13 10:51:12,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-13 10:51:12,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 70 states have (on average 1.4) internal successors, (98), 82 states have internal predecessors, (98), 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-10-13 10:51:12,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 104 transitions. [2024-10-13 10:51:12,016 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 104 transitions. Word has length 30 [2024-10-13 10:51:12,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:51:12,016 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 104 transitions. [2024-10-13 10:51:12,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 22 states have internal predecessors, (55), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:51:12,022 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 104 transitions. [2024-10-13 10:51:12,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-13 10:51:12,022 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:51:12,022 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] [2024-10-13 10:51:12,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-13 10:51:12,222 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,SelfDestructingSolverStorable31 [2024-10-13 10:51:12,223 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-13 10:51:12,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:51:12,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1332522749, now seen corresponding path program 1 times [2024-10-13 10:51:12,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:51:12,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015355629] [2024-10-13 10:51:12,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:51:12,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:51:12,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:12,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:51:12,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:12,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 10:51:12,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:12,680 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:51:12,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:51:12,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015355629] [2024-10-13 10:51:12,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015355629] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:51:12,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523969710] [2024-10-13 10:51:12,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:51:12,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:51:12,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:51:12,683 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-10-13 10:51:12,683 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-10-13 10:51:12,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:12,833 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-10-13 10:51:12,835 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:51:12,992 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:51:12,993 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-10-13 10:51:13,024 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-10-13 10:51:13,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 10:51:13,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-10-13 10:51:13,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:51:13,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 32 [2024-10-13 10:51:13,167 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-13 10:51:13,167 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-10-13 10:51:13,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-13 10:51:13,274 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:51:13,275 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:51:13,346 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-10-13 10:51:13,346 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 21 treesize of output 20 [2024-10-13 10:51:13,525 INFO L349 Elim1Store]: treesize reduction 19, result has 69.4 percent of original size [2024-10-13 10:51:13,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 102 [2024-10-13 10:51:13,569 INFO L349 Elim1Store]: treesize reduction 40, result has 50.0 percent of original size [2024-10-13 10:51:13,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 96 treesize of output 109 [2024-10-13 10:51:13,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:51:13,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 66 [2024-10-13 10:51:13,596 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 86 treesize of output 78 [2024-10-13 10:51:13,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-10-13 10:51:13,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-10-13 10:51:13,733 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:51:13,733 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 86 treesize of output 84 [2024-10-13 10:51:13,811 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:51:13,811 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 35 treesize of output 35 [2024-10-13 10:51:13,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523969710] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:51:13,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:51:13,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2024-10-13 10:51:13,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443444855] [2024-10-13 10:51:13,928 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:51:13,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-13 10:51:13,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:51:13,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-13 10:51:13,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1649, Unknown=7, NotChecked=0, Total=1806 [2024-10-13 10:51:13,930 INFO L87 Difference]: Start difference. First operand 87 states and 104 transitions. Second operand has 35 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 29 states have internal predecessors, (50), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 10:51:14,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:51:14,293 INFO L93 Difference]: Finished difference Result 90 states and 109 transitions. [2024-10-13 10:51:14,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 10:51:14,293 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 29 states have internal predecessors, (50), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2024-10-13 10:51:14,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:51:14,293 INFO L225 Difference]: With dead ends: 90 [2024-10-13 10:51:14,293 INFO L226 Difference]: Without dead ends: 90 [2024-10-13 10:51:14,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=242, Invalid=2301, Unknown=7, NotChecked=0, Total=2550 [2024-10-13 10:51:14,294 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 16 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:51:14,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 484 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:51:14,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-13 10:51:14,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2024-10-13 10:51:14,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 72 states have (on average 1.4027777777777777) internal successors, (101), 84 states have internal predecessors, (101), 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-10-13 10:51:14,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 107 transitions. [2024-10-13 10:51:14,297 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 107 transitions. Word has length 31 [2024-10-13 10:51:14,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:51:14,297 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 107 transitions. [2024-10-13 10:51:14,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 29 states have internal predecessors, (50), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 10:51:14,297 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 107 transitions. [2024-10-13 10:51:14,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-13 10:51:14,297 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:51:14,297 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] [2024-10-13 10:51:14,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-13 10:51:14,499 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,SelfDestructingSolverStorable32 [2024-10-13 10:51:14,499 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-13 10:51:14,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:51:14,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1332522748, now seen corresponding path program 1 times [2024-10-13 10:51:14,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:51:14,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621102917] [2024-10-13 10:51:14,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:51:14,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:51:14,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:14,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:51:14,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:15,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 10:51:15,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:15,066 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:51:15,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:51:15,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621102917] [2024-10-13 10:51:15,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621102917] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:51:15,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753780367] [2024-10-13 10:51:15,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:51:15,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:51:15,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:51:15,068 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-10-13 10:51:15,069 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-10-13 10:51:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:15,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-10-13 10:51:15,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:51:15,366 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:51:15,367 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-10-13 10:51:15,388 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-10-13 10:51:15,395 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-10-13 10:51:15,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:51:15,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 47 [2024-10-13 10:51:15,469 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-10-13 10:51:15,543 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-13 10:51:15,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-10-13 10:51:15,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-10-13 10:51:15,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-13 10:51:15,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-13 10:51:15,694 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:51:15,694 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:51:15,915 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:51:15,915 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 112 treesize of output 116 [2024-10-13 10:51:16,155 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:51:16,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 64 [2024-10-13 10:51:16,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:51:16,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 123 [2024-10-13 10:51:16,170 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 108 treesize of output 96 [2024-10-13 10:51:16,174 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 63 treesize of output 59 [2024-10-13 10:51:16,215 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:51:16,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 64 [2024-10-13 10:51:16,222 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:51:16,224 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:51:16,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:51:16,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-10-13 10:51:16,229 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:51:16,232 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-10-13 10:51:16,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2024-10-13 10:51:16,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753780367] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:51:16,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:51:16,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 34 [2024-10-13 10:51:16,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532234268] [2024-10-13 10:51:16,317 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:51:16,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-13 10:51:16,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:51:16,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-13 10:51:16,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1798, Unknown=10, NotChecked=0, Total=1980 [2024-10-13 10:51:16,318 INFO L87 Difference]: Start difference. First operand 89 states and 107 transitions. Second operand has 35 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 29 states have internal predecessors, (53), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 10:51:16,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:51:16,723 INFO L93 Difference]: Finished difference Result 90 states and 108 transitions. [2024-10-13 10:51:16,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 10:51:16,723 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 29 states have internal predecessors, (53), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2024-10-13 10:51:16,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:51:16,723 INFO L225 Difference]: With dead ends: 90 [2024-10-13 10:51:16,724 INFO L226 Difference]: Without dead ends: 90 [2024-10-13 10:51:16,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=245, Invalid=2195, Unknown=10, NotChecked=0, Total=2450 [2024-10-13 10:51:16,724 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 13 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:51:16,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 650 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:51:16,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-13 10:51:16,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2024-10-13 10:51:16,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 72 states have (on average 1.3888888888888888) internal successors, (100), 84 states have internal predecessors, (100), 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-10-13 10:51:16,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 106 transitions. [2024-10-13 10:51:16,726 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 106 transitions. Word has length 31 [2024-10-13 10:51:16,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:51:16,726 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 106 transitions. [2024-10-13 10:51:16,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 29 states have internal predecessors, (53), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 10:51:16,727 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 106 transitions. [2024-10-13 10:51:16,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-13 10:51:16,727 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:51:16,727 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:51:16,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-13 10:51:16,930 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,SelfDestructingSolverStorable33 [2024-10-13 10:51:16,930 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-13 10:51:16,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:51:16,931 INFO L85 PathProgramCache]: Analyzing trace with hash -657671097, now seen corresponding path program 1 times [2024-10-13 10:51:16,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:51:16,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189490069] [2024-10-13 10:51:16,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:51:16,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:51:16,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:17,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:51:17,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:17,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 10:51:17,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:17,359 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 10:51:17,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:51:17,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189490069] [2024-10-13 10:51:17,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189490069] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:51:17,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414887388] [2024-10-13 10:51:17,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:51:17,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:51:17,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:51:17,361 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-10-13 10:51:17,361 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-10-13 10:51:17,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:17,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-10-13 10:51:17,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:51:17,570 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-10-13 10:51:17,646 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:51:17,647 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-10-13 10:51:17,680 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-10-13 10:51:17,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:51:17,685 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-10-13 10:51:17,760 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-13 10:51:17,760 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 51 treesize of output 48 [2024-10-13 10:51:17,763 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 28 treesize of output 11 [2024-10-13 10:51:17,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2024-10-13 10:51:17,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-13 10:51:17,886 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:51:17,886 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:51:18,098 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:51:18,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 43 [2024-10-13 10:51:18,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 64 [2024-10-13 10:51:18,107 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 31 treesize of output 27 [2024-10-13 10:51:18,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414887388] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:51:18,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:51:18,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 29 [2024-10-13 10:51:18,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482633972] [2024-10-13 10:51:18,309 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:51:18,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-13 10:51:18,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:51:18,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-13 10:51:18,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1322, Unknown=14, NotChecked=0, Total=1482 [2024-10-13 10:51:18,310 INFO L87 Difference]: Start difference. First operand 89 states and 106 transitions. Second operand has 30 states, 27 states have (on average 2.0) internal successors, (54), 25 states have internal predecessors, (54), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 10:51:18,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:51:18,664 INFO L93 Difference]: Finished difference Result 112 states and 132 transitions. [2024-10-13 10:51:18,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-13 10:51:18,665 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 2.0) internal successors, (54), 25 states have internal predecessors, (54), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 33 [2024-10-13 10:51:18,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:51:18,665 INFO L225 Difference]: With dead ends: 112 [2024-10-13 10:51:18,665 INFO L226 Difference]: Without dead ends: 112 [2024-10-13 10:51:18,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=244, Invalid=1998, Unknown=14, NotChecked=0, Total=2256 [2024-10-13 10:51:18,666 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 33 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:51:18,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 381 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:51:18,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-13 10:51:18,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 97. [2024-10-13 10:51:18,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.35) internal successors, (108), 92 states have internal predecessors, (108), 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-10-13 10:51:18,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 114 transitions. [2024-10-13 10:51:18,668 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 114 transitions. Word has length 33 [2024-10-13 10:51:18,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:51:18,668 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 114 transitions. [2024-10-13 10:51:18,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 2.0) internal successors, (54), 25 states have internal predecessors, (54), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 10:51:18,668 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 114 transitions. [2024-10-13 10:51:18,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-13 10:51:18,669 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:51:18,669 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:51:18,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-10-13 10:51:18,869 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,SelfDestructingSolverStorable34 [2024-10-13 10:51:18,869 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-13 10:51:18,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:51:18,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1485700593, now seen corresponding path program 1 times [2024-10-13 10:51:18,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:51:18,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141205514] [2024-10-13 10:51:18,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:51:18,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:51:18,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:19,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:51:19,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:19,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 10:51:19,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:19,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 10:51:19,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:19,361 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 10:51:19,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:51:19,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141205514] [2024-10-13 10:51:19,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141205514] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:51:19,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139358967] [2024-10-13 10:51:19,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:51:19,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:51:19,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:51:19,363 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-10-13 10:51:19,364 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-10-13 10:51:19,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:19,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-10-13 10:51:19,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:51:19,644 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:51:19,644 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-10-13 10:51:19,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 10:51:19,672 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-10-13 10:51:19,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-10-13 10:51:19,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:51:19,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 37 [2024-10-13 10:51:19,787 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-13 10:51:19,788 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-10-13 10:51:19,794 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-10-13 10:51:19,817 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-10-13 10:51:19,853 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:51:19,853 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-10-13 10:51:19,860 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-10-13 10:51:19,867 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-10-13 10:51:19,903 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-13 10:51:19,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-10-13 10:51:19,907 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-10-13 10:51:19,913 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-10-13 10:51:19,915 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-10-13 10:51:19,918 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:51:19,918 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:51:19,966 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (and (forall ((v_ArrVal_2833 (Array Int Int)) (v_ArrVal_2832 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2832) |c_ULTIMATE.start_create_~now~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2833) |c_ULTIMATE.start_create_~now~0#1.base|) .cse0)))) (forall ((v_ArrVal_2832 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2832) |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))))) is different from false [2024-10-13 10:51:20,032 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:51:20,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2024-10-13 10:51:20,036 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:51:20,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2024-10-13 10:51:20,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 50 [2024-10-13 10:51:20,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 78 [2024-10-13 10:51:20,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-13 10:51:20,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 10:51:20,051 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:51:20,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-10-13 10:51:20,053 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:51:20,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-10-13 10:51:20,260 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2828 (Array Int Int))) (not (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem10#1.base| v_ArrVal_2828) |c_ULTIMATE.start_create_~now~0#1.base|) (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) 0))) is different from false [2024-10-13 10:51:20,305 INFO L349 Elim1Store]: treesize reduction 5, result has 88.4 percent of original size [2024-10-13 10:51:20,305 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 48 treesize of output 47 [2024-10-13 10:51:20,309 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2827 Int) (v_ArrVal_2828 (Array Int Int))) (= |c_ULTIMATE.start_create_#t~mem9#1.base| (let ((.cse1 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| (store (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base|) (+ 16 |c_ULTIMATE.start_create_#t~mem9#1.offset|) v_ArrVal_2827)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_2828)) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)))) is different from false [2024-10-13 10:51:20,398 INFO L349 Elim1Store]: treesize reduction 24, result has 61.3 percent of original size [2024-10-13 10:51:20,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 97 [2024-10-13 10:51:20,406 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 253 treesize of output 241 [2024-10-13 10:51:20,413 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 66 treesize of output 58 [2024-10-13 10:51:20,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-13 10:51:20,572 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 1 refuted. 1 times theorem prover too weak. 4 trivial. 2 not checked. [2024-10-13 10:51:20,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139358967] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:51:20,572 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:51:20,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21, 18] total 49 [2024-10-13 10:51:20,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914087904] [2024-10-13 10:51:20,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:51:20,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-13 10:51:20,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:51:20,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-13 10:51:20,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1970, Unknown=32, NotChecked=276, Total=2450 [2024-10-13 10:51:20,573 INFO L87 Difference]: Start difference. First operand 97 states and 114 transitions. Second operand has 50 states, 43 states have (on average 1.627906976744186) internal successors, (70), 41 states have internal predecessors, (70), 4 states have call successors, (6), 4 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-13 10:51:21,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:51:21,145 INFO L93 Difference]: Finished difference Result 96 states and 113 transitions. [2024-10-13 10:51:21,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 10:51:21,145 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 43 states have (on average 1.627906976744186) internal successors, (70), 41 states have internal predecessors, (70), 4 states have call successors, (6), 4 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) Word has length 34 [2024-10-13 10:51:21,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:51:21,146 INFO L225 Difference]: With dead ends: 96 [2024-10-13 10:51:21,146 INFO L226 Difference]: Without dead ends: 96 [2024-10-13 10:51:21,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=261, Invalid=2475, Unknown=32, NotChecked=312, Total=3080 [2024-10-13 10:51:21,147 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 17 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:51:21,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 835 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 604 Invalid, 0 Unknown, 76 Unchecked, 0.4s Time] [2024-10-13 10:51:21,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-13 10:51:21,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-10-13 10:51:21,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 80 states have (on average 1.3375) internal successors, (107), 91 states have internal predecessors, (107), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 10:51:21,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 113 transitions. [2024-10-13 10:51:21,149 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 113 transitions. Word has length 34 [2024-10-13 10:51:21,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:51:21,149 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 113 transitions. [2024-10-13 10:51:21,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 43 states have (on average 1.627906976744186) internal successors, (70), 41 states have internal predecessors, (70), 4 states have call successors, (6), 4 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-13 10:51:21,149 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 113 transitions. [2024-10-13 10:51:21,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-13 10:51:21,150 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:51:21,150 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:51:21,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-10-13 10:51:21,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:51:21,351 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-13 10:51:21,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:51:21,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1087032595, now seen corresponding path program 1 times [2024-10-13 10:51:21,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:51:21,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924962509] [2024-10-13 10:51:21,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:51:21,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:51:21,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:21,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:51:21,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:21,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 10:51:21,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:21,766 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 10:51:21,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:51:21,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924962509] [2024-10-13 10:51:21,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924962509] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:51:21,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959784284] [2024-10-13 10:51:21,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:51:21,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:51:21,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:51:21,768 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:51:21,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-13 10:51:21,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:21,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-10-13 10:51:21,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:51:22,003 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-10-13 10:51:22,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-10-13 10:51:22,093 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:51:22,093 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-10-13 10:51:22,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:51:22,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-10-13 10:51:22,199 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-13 10:51:22,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2024-10-13 10:51:22,237 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-13 10:51:22,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2024-10-13 10:51:22,331 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:51:22,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 13 [2024-10-13 10:51:22,334 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:51:22,334 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:51:22,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959784284] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:51:22,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:51:22,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 29 [2024-10-13 10:51:22,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306981019] [2024-10-13 10:51:22,627 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:51:22,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-13 10:51:22,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:51:22,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-13 10:51:22,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1324, Unknown=14, NotChecked=0, Total=1482 [2024-10-13 10:51:22,628 INFO L87 Difference]: Start difference. First operand 96 states and 113 transitions. Second operand has 30 states, 27 states have (on average 2.037037037037037) internal successors, (55), 25 states have internal predecessors, (55), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 10:51:23,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:51:23,070 INFO L93 Difference]: Finished difference Result 110 states and 129 transitions. [2024-10-13 10:51:23,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 10:51:23,070 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 2.037037037037037) internal successors, (55), 25 states have internal predecessors, (55), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 34 [2024-10-13 10:51:23,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:51:23,071 INFO L225 Difference]: With dead ends: 110 [2024-10-13 10:51:23,071 INFO L226 Difference]: Without dead ends: 110 [2024-10-13 10:51:23,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=240, Invalid=2002, Unknown=14, NotChecked=0, Total=2256 [2024-10-13 10:51:23,071 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 32 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:51:23,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 397 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:51:23,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-13 10:51:23,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 98. [2024-10-13 10:51:23,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 82 states have (on average 1.329268292682927) internal successors, (109), 93 states have internal predecessors, (109), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 10:51:23,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 115 transitions. [2024-10-13 10:51:23,074 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 115 transitions. Word has length 34 [2024-10-13 10:51:23,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:51:23,074 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 115 transitions. [2024-10-13 10:51:23,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 2.037037037037037) internal successors, (55), 25 states have internal predecessors, (55), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 10:51:23,074 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 115 transitions. [2024-10-13 10:51:23,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-13 10:51:23,075 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:51:23,075 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:51:23,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-10-13 10:51:23,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-10-13 10:51:23,275 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-10-13 10:51:23,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:51:23,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1199448066, now seen corresponding path program 2 times [2024-10-13 10:51:23,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:51:23,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589459425] [2024-10-13 10:51:23,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:51:23,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:51:23,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:24,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:51:24,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:24,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 10:51:24,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:51:24,186 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:51:24,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:51:24,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589459425] [2024-10-13 10:51:24,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589459425] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:51:24,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437462312] [2024-10-13 10:51:24,187 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:51:24,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:51:24,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:51:24,188 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:51:24,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-13 10:51:24,394 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:51:24,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:51:24,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-10-13 10:51:24,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:51:24,524 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-10-13 10:51:24,528 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-10-13 10:51:24,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-13 10:51:24,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-13 10:51:24,548 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:51:24,549 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-10-13 10:51:24,583 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 26 [2024-10-13 10:51:24,592 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 33 treesize of output 17 [2024-10-13 10:51:24,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:51:24,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:51:24,671 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-13 10:51:24,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 62 [2024-10-13 10:51:24,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:51:24,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2024-10-13 10:51:24,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:51:24,809 INFO L349 Elim1Store]: treesize reduction 47, result has 16.1 percent of original size [2024-10-13 10:51:24,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 118 treesize of output 69 [2024-10-13 10:51:24,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:51:24,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:51:24,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:51:24,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 47 [2024-10-13 10:51:25,066 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-13 10:51:25,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 27 [2024-10-13 10:51:25,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:51:25,070 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 0 case distinctions, treesize of input 26 treesize of output 10 [2024-10-13 10:51:25,092 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:51:25,092 INFO L311 TraceCheckSpWp]: Computing backward predicates...