./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/20051113-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/20051113-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2a43a02844acf962bfa6f77d0e1512c06ac1cc2fb3c3905e584a292a069b5426 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:38:27,311 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:38:27,367 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 10:38:27,374 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:38:27,375 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:38:27,407 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:38:27,409 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:38:27,410 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:38:27,411 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:38:27,412 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:38:27,413 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:38:27,413 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:38:27,414 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:38:27,414 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:38:27,414 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:38:27,414 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:38:27,415 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:38:27,417 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:38:27,417 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:38:27,418 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:38:27,418 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:38:27,418 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:38:27,422 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 10:38:27,422 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:38:27,422 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:38:27,423 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:38:27,423 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:38:27,423 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:38:27,423 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:38:27,424 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:38:27,424 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:38:27,424 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:38:27,424 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:38:27,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:38:27,425 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:38:27,425 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:38:27,425 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:38:27,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:38:27,426 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:38:27,426 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:38:27,426 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:38:27,427 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:38:27,427 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2a43a02844acf962bfa6f77d0e1512c06ac1cc2fb3c3905e584a292a069b5426 [2024-10-13 10:38:27,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:38:27,716 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:38:27,719 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:38:27,720 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:38:27,721 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:38:27,722 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/20051113-1.i [2024-10-13 10:38:29,155 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:38:29,427 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:38:29,427 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/20051113-1.i [2024-10-13 10:38:29,448 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fbb506d4/1e0aab9098b6437dac21a9f87acf235d/FLAG6a42f543a [2024-10-13 10:38:29,730 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fbb506d4/1e0aab9098b6437dac21a9f87acf235d [2024-10-13 10:38:29,732 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:38:29,733 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:38:29,735 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:38:29,736 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:38:29,740 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:38:29,741 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:38:29" (1/1) ... [2024-10-13 10:38:29,742 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4837f422 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:38:29, skipping insertion in model container [2024-10-13 10:38:29,742 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:38:29" (1/1) ... [2024-10-13 10:38:29,782 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:38:30,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:38:30,148 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:38:30,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:38:30,228 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:38:30,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:38:30 WrapperNode [2024-10-13 10:38:30,228 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:38:30,229 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:38:30,229 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:38:30,230 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:38:30,236 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:38:30" (1/1) ... [2024-10-13 10:38:30,248 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:38:30" (1/1) ... [2024-10-13 10:38:30,268 INFO L138 Inliner]: procedures = 125, calls = 23, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 76 [2024-10-13 10:38:30,271 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:38:30,272 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:38:30,272 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:38:30,272 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:38:30,284 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:38:30" (1/1) ... [2024-10-13 10:38:30,285 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:38:30" (1/1) ... [2024-10-13 10:38:30,288 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:38:30" (1/1) ... [2024-10-13 10:38:30,315 INFO L175 MemorySlicer]: Split 14 memory accesses to 2 slices as follows [2, 12]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 8 writes are split as follows [0, 8]. [2024-10-13 10:38:30,316 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:38:30" (1/1) ... [2024-10-13 10:38:30,316 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:38:30" (1/1) ... [2024-10-13 10:38:30,325 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:38:30" (1/1) ... [2024-10-13 10:38:30,328 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:38:30" (1/1) ... [2024-10-13 10:38:30,330 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:38:30" (1/1) ... [2024-10-13 10:38:30,331 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:38:30" (1/1) ... [2024-10-13 10:38:30,333 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:38:30,334 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:38:30,334 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:38:30,335 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:38:30,335 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:38:30" (1/1) ... [2024-10-13 10:38:30,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:38:30,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:38:30,370 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:38:30,373 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:38:30,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 10:38:30,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 10:38:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 10:38:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 10:38:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 10:38:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 10:38:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure dummy_abort [2024-10-13 10:38:30,423 INFO L138 BoogieDeclarations]: Found implementation of procedure dummy_abort [2024-10-13 10:38:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 10:38:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 10:38:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:38:30,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:38:30,517 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:38:30,519 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:38:30,767 INFO L? ?]: Removed 61 outVars from TransFormulas that were not future-live. [2024-10-13 10:38:30,767 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:38:30,813 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:38:30,816 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 10:38:30,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:38:30 BoogieIcfgContainer [2024-10-13 10:38:30,817 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:38:30,819 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:38:30,820 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:38:30,824 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:38:30,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:38:29" (1/3) ... [2024-10-13 10:38:30,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dbe15fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:38:30, skipping insertion in model container [2024-10-13 10:38:30,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:38:30" (2/3) ... [2024-10-13 10:38:30,826 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dbe15fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:38:30, skipping insertion in model container [2024-10-13 10:38:30,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:38:30" (3/3) ... [2024-10-13 10:38:30,829 INFO L112 eAbstractionObserver]: Analyzing ICFG 20051113-1.i [2024-10-13 10:38:30,845 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:38:30,846 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2024-10-13 10:38:30,898 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:38:30,906 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;@48041f05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:38:30,906 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2024-10-13 10:38:30,911 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 25 states have (on average 2.28) internal successors, (57), 52 states have internal predecessors, (57), 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:38:30,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-13 10:38:30,917 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:38:30,918 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-13 10:38:30,918 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:38:30,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:38:30,925 INFO L85 PathProgramCache]: Analyzing trace with hash 4499, now seen corresponding path program 1 times [2024-10-13 10:38:30,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:38:30,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520397801] [2024-10-13 10:38:30,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:38:30,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:38:31,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:38:31,175 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:38:31,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:38:31,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520397801] [2024-10-13 10:38:31,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520397801] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:38:31,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:38:31,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 10:38:31,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625317436] [2024-10-13 10:38:31,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:38:31,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:38:31,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:38:31,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:38:31,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:38:31,211 INFO L87 Difference]: Start difference. First operand has 54 states, 25 states have (on average 2.28) internal successors, (57), 52 states have internal predecessors, (57), 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.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:38:31,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:38:31,299 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2024-10-13 10:38:31,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:38:31,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-13 10:38:31,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:38:31,310 INFO L225 Difference]: With dead ends: 53 [2024-10-13 10:38:31,310 INFO L226 Difference]: Without dead ends: 52 [2024-10-13 10:38:31,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:38:31,315 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 3 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:38:31,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 72 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:38:31,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-13 10:38:31,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-13 10:38:31,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 25 states have (on average 2.12) internal successors, (53), 50 states have internal predecessors, (53), 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:38:31,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2024-10-13 10:38:31,352 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 2 [2024-10-13 10:38:31,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:38:31,353 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2024-10-13 10:38:31,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:38:31,356 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2024-10-13 10:38:31,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-13 10:38:31,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:38:31,356 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-13 10:38:31,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 10:38:31,357 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:38:31,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:38:31,358 INFO L85 PathProgramCache]: Analyzing trace with hash 139506, now seen corresponding path program 1 times [2024-10-13 10:38:31,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:38:31,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286780027] [2024-10-13 10:38:31,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:38:31,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:38:31,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:38:31,574 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:38:31,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:38:31,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286780027] [2024-10-13 10:38:31,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286780027] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:38:31,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:38:31,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 10:38:31,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848576872] [2024-10-13 10:38:31,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:38:31,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:38:31,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:38:31,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:38:31,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:38:31,581 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:38:31,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:38:31,647 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2024-10-13 10:38:31,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:38:31,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-13 10:38:31,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:38:31,649 INFO L225 Difference]: With dead ends: 51 [2024-10-13 10:38:31,649 INFO L226 Difference]: Without dead ends: 51 [2024-10-13 10:38:31,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:38:31,651 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 2 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:38:31,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 73 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:38:31,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-13 10:38:31,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-13 10:38:31,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 25 states have (on average 2.08) internal successors, (52), 49 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:38:31,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2024-10-13 10:38:31,659 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 3 [2024-10-13 10:38:31,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:38:31,660 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2024-10-13 10:38:31,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:38:31,660 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2024-10-13 10:38:31,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 10:38:31,660 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:38:31,660 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 10:38:31,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 10:38:31,661 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:38:31,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:38:31,665 INFO L85 PathProgramCache]: Analyzing trace with hash 134069809, now seen corresponding path program 1 times [2024-10-13 10:38:31,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:38:31,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501496017] [2024-10-13 10:38:31,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:38:31,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:38:31,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:38:31,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:38:31,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:38:31,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501496017] [2024-10-13 10:38:31,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501496017] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:38:31,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:38:31,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:38:31,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179421848] [2024-10-13 10:38:31,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:38:31,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:38:31,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:38:31,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:38:31,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:38:31,791 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:38:31,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:38:31,898 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2024-10-13 10:38:31,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:38:31,898 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-13 10:38:31,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:38:31,899 INFO L225 Difference]: With dead ends: 44 [2024-10-13 10:38:31,899 INFO L226 Difference]: Without dead ends: 44 [2024-10-13 10:38:31,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:38:31,902 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 21 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:38:31,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 48 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:38:31,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-13 10:38:31,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-13 10:38:31,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 25 states have (on average 1.8) internal successors, (45), 42 states have internal predecessors, (45), 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:38:31,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2024-10-13 10:38:31,913 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 5 [2024-10-13 10:38:31,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:38:31,913 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2024-10-13 10:38:31,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:38:31,914 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2024-10-13 10:38:31,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 10:38:31,915 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:38:31,915 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 10:38:31,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 10:38:31,915 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:38:31,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:38:31,916 INFO L85 PathProgramCache]: Analyzing trace with hash 134069810, now seen corresponding path program 1 times [2024-10-13 10:38:31,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:38:31,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337768990] [2024-10-13 10:38:31,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:38:31,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:38:31,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:38:32,011 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:38:32,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:38:32,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337768990] [2024-10-13 10:38:32,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337768990] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:38:32,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:38:32,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 10:38:32,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076653722] [2024-10-13 10:38:32,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:38:32,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:38:32,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:38:32,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:38:32,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:38:32,017 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:38:32,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:38:32,074 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2024-10-13 10:38:32,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:38:32,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-13 10:38:32,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:38:32,075 INFO L225 Difference]: With dead ends: 37 [2024-10-13 10:38:32,075 INFO L226 Difference]: Without dead ends: 37 [2024-10-13 10:38:32,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:38:32,077 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 19 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:38:32,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 35 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:38:32,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-13 10:38:32,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-13 10:38:32,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.52) internal successors, (38), 35 states have internal predecessors, (38), 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:38:32,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2024-10-13 10:38:32,084 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 5 [2024-10-13 10:38:32,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:38:32,084 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2024-10-13 10:38:32,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:38:32,085 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2024-10-13 10:38:32,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 10:38:32,085 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:38:32,087 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:38:32,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 10:38:32,087 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:38:32,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:38:32,088 INFO L85 PathProgramCache]: Analyzing trace with hash 519534435, now seen corresponding path program 1 times [2024-10-13 10:38:32,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:38:32,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139450125] [2024-10-13 10:38:32,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:38:32,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:38:32,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:38:32,182 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:38:32,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:38:32,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139450125] [2024-10-13 10:38:32,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139450125] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:38:32,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:38:32,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:38:32,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141519820] [2024-10-13 10:38:32,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:38:32,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:38:32,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:38:32,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:38:32,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:38:32,185 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:38:32,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:38:32,251 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2024-10-13 10:38:32,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:38:32,252 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-13 10:38:32,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:38:32,253 INFO L225 Difference]: With dead ends: 35 [2024-10-13 10:38:32,253 INFO L226 Difference]: Without dead ends: 35 [2024-10-13 10:38:32,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:38:32,254 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 18 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:38:32,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 44 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:38:32,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-13 10:38:32,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-13 10:38:32,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.44) internal successors, (36), 33 states have internal predecessors, (36), 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:38:32,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2024-10-13 10:38:32,262 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 12 [2024-10-13 10:38:32,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:38:32,262 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2024-10-13 10:38:32,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:38:32,262 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2024-10-13 10:38:32,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 10:38:32,263 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:38:32,263 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:38:32,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 10:38:32,263 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:38:32,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:38:32,267 INFO L85 PathProgramCache]: Analyzing trace with hash 519534436, now seen corresponding path program 1 times [2024-10-13 10:38:32,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:38:32,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817354102] [2024-10-13 10:38:32,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:38:32,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:38:32,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:38:32,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:38:32,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:38:32,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817354102] [2024-10-13 10:38:32,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817354102] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:38:32,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:38:32,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:38:32,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37198404] [2024-10-13 10:38:32,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:38:32,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:38:32,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:38:32,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:38:32,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:38:32,444 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:38:32,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:38:32,509 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2024-10-13 10:38:32,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:38:32,510 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-13 10:38:32,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:38:32,510 INFO L225 Difference]: With dead ends: 34 [2024-10-13 10:38:32,511 INFO L226 Difference]: Without dead ends: 34 [2024-10-13 10:38:32,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:38:32,516 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:38:32,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 48 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:38:32,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-13 10:38:32,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-10-13 10:38:32,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 25 states have (on average 1.4) internal successors, (35), 32 states have internal predecessors, (35), 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:38:32,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2024-10-13 10:38:32,528 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 12 [2024-10-13 10:38:32,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:38:32,528 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2024-10-13 10:38:32,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:38:32,528 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2024-10-13 10:38:32,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 10:38:32,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:38:32,529 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:38:32,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 10:38:32,529 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:38:32,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:38:32,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1056386277, now seen corresponding path program 1 times [2024-10-13 10:38:32,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:38:32,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462653634] [2024-10-13 10:38:32,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:38:32,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:38:32,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:38:32,717 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:38:32,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:38:32,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462653634] [2024-10-13 10:38:32,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462653634] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:38:32,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:38:32,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:38:32,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230852300] [2024-10-13 10:38:32,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:38:32,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:38:32,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:38:32,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:38:32,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:38:32,720 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:38:32,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:38:32,783 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2024-10-13 10:38:32,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:38:32,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-13 10:38:32,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:38:32,785 INFO L225 Difference]: With dead ends: 37 [2024-10-13 10:38:32,785 INFO L226 Difference]: Without dead ends: 37 [2024-10-13 10:38:32,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:38:32,786 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 14 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:38:32,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 46 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:38:32,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-13 10:38:32,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-13 10:38:32,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 35 states have internal predecessors, (39), 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:38:32,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2024-10-13 10:38:32,790 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 14 [2024-10-13 10:38:32,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:38:32,791 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-10-13 10:38:32,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:38:32,791 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2024-10-13 10:38:32,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 10:38:32,792 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:38:32,792 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:38:32,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 10:38:32,793 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:38:32,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:38:32,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1579998924, now seen corresponding path program 1 times [2024-10-13 10:38:32,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:38:32,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521493582] [2024-10-13 10:38:32,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:38:32,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:38:32,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:38:32,946 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:38:32,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:38:32,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521493582] [2024-10-13 10:38:32,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521493582] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:38:32,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456690406] [2024-10-13 10:38:32,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:38:32,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:38:32,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:38:32,949 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:38:32,953 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:38:33,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:38:33,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-13 10:38:33,031 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:38:33,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:38:33,231 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:38:33,463 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:38:33,464 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 13 treesize of output 17 [2024-10-13 10:38:33,523 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:38:33,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456690406] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:38:33,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:38:33,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 12 [2024-10-13 10:38:33,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994646431] [2024-10-13 10:38:33,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:38:33,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 10:38:33,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:38:33,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 10:38:33,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-10-13 10:38:33,525 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:38:33,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:38:33,761 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2024-10-13 10:38:33,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:38:33,762 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-13 10:38:33,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:38:33,763 INFO L225 Difference]: With dead ends: 43 [2024-10-13 10:38:33,763 INFO L226 Difference]: Without dead ends: 43 [2024-10-13 10:38:33,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2024-10-13 10:38:33,765 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 24 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:38:33,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 150 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:38:33,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-13 10:38:33,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-13 10:38:33,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 41 states have internal predecessors, (47), 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:38:33,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2024-10-13 10:38:33,773 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 17 [2024-10-13 10:38:33,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:38:33,773 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2024-10-13 10:38:33,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:38:33,774 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2024-10-13 10:38:33,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 10:38:33,774 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:38:33,774 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:38:33,793 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:38:33,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:38:33,979 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:38:33,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:38:33,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1578355295, now seen corresponding path program 1 times [2024-10-13 10:38:33,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:38:33,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033276099] [2024-10-13 10:38:33,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:38:33,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:38:33,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:38:34,044 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:38:34,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:38:34,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033276099] [2024-10-13 10:38:34,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033276099] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:38:34,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:38:34,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:38:34,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619673796] [2024-10-13 10:38:34,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:38:34,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:38:34,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:38:34,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:38:34,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:38:34,047 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:38:34,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:38:34,096 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2024-10-13 10:38:34,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:38:34,097 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-13 10:38:34,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:38:34,098 INFO L225 Difference]: With dead ends: 41 [2024-10-13 10:38:34,098 INFO L226 Difference]: Without dead ends: 41 [2024-10-13 10:38:34,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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:38:34,099 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 12 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:38:34,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 37 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:38:34,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-13 10:38:34,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-13 10:38:34,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 39 states have internal predecessors, (45), 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:38:34,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2024-10-13 10:38:34,103 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 17 [2024-10-13 10:38:34,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:38:34,104 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2024-10-13 10:38:34,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:38:34,104 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2024-10-13 10:38:34,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 10:38:34,104 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:38:34,104 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:38:34,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 10:38:34,105 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:38:34,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:38:34,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1578355296, now seen corresponding path program 1 times [2024-10-13 10:38:34,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:38:34,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804081504] [2024-10-13 10:38:34,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:38:34,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:38:34,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:38:34,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:38:34,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:38:34,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804081504] [2024-10-13 10:38:34,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804081504] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:38:34,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:38:34,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:38:34,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745332253] [2024-10-13 10:38:34,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:38:34,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:38:34,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:38:34,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:38:34,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:38:34,420 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:38:34,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:38:34,499 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2024-10-13 10:38:34,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:38:34,499 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-13 10:38:34,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:38:34,500 INFO L225 Difference]: With dead ends: 41 [2024-10-13 10:38:34,500 INFO L226 Difference]: Without dead ends: 41 [2024-10-13 10:38:34,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:38:34,501 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 13 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:38:34,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 70 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:38:34,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-13 10:38:34,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-13 10:38:34,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 39 states have internal predecessors, (44), 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:38:34,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2024-10-13 10:38:34,506 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 17 [2024-10-13 10:38:34,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:38:34,507 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2024-10-13 10:38:34,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:38:34,507 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2024-10-13 10:38:34,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-13 10:38:34,507 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:38:34,507 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:38:34,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 10:38:34,508 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:38:34,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:38:34,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1201503001, now seen corresponding path program 1 times [2024-10-13 10:38:34,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:38:34,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478998719] [2024-10-13 10:38:34,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:38:34,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:38:34,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:38:34,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:38:34,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:38:34,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478998719] [2024-10-13 10:38:34,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478998719] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:38:34,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810836599] [2024-10-13 10:38:34,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:38:34,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:38:34,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:38:34,774 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:38:34,775 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:38:34,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:38:34,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-13 10:38:34,860 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:38:34,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 10:38:34,988 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:38:34,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810836599] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:38:34,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 10:38:34,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 9 [2024-10-13 10:38:34,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606478743] [2024-10-13 10:38:34,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:38:34,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:38:34,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:38:34,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:38:34,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-13 10:38:34,990 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:38:35,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:38:35,061 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2024-10-13 10:38:35,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:38:35,062 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-10-13 10:38:35,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:38:35,062 INFO L225 Difference]: With dead ends: 40 [2024-10-13 10:38:35,062 INFO L226 Difference]: Without dead ends: 40 [2024-10-13 10:38:35,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:38:35,063 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 10 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:38:35,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 49 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:38:35,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-13 10:38:35,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-10-13 10:38:35,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 38 states have internal predecessors, (43), 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:38:35,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2024-10-13 10:38:35,067 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 20 [2024-10-13 10:38:35,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:38:35,067 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2024-10-13 10:38:35,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:38:35,068 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2024-10-13 10:38:35,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-13 10:38:35,068 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:38:35,068 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] [2024-10-13 10:38:35,083 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:38:35,269 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,SelfDestructingSolverStorable10 [2024-10-13 10:38:35,269 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:38:35,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:38:35,270 INFO L85 PathProgramCache]: Analyzing trace with hash -701818054, now seen corresponding path program 1 times [2024-10-13 10:38:35,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:38:35,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788868421] [2024-10-13 10:38:35,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:38:35,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:38:35,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:38:35,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:38:35,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:38:35,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788868421] [2024-10-13 10:38:35,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788868421] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:38:35,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607753965] [2024-10-13 10:38:35,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:38:35,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:38:35,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:38:35,592 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:38:35,593 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:38:35,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:38:35,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-13 10:38:35,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:38:35,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 10:38:35,825 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:38:35,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607753965] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:38:35,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 10:38:35,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2024-10-13 10:38:35,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245916547] [2024-10-13 10:38:35,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:38:35,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:38:35,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:38:35,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:38:35,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:38:35,828 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:38:35,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:38:35,910 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2024-10-13 10:38:35,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:38:35,911 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-10-13 10:38:35,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:38:35,911 INFO L225 Difference]: With dead ends: 43 [2024-10-13 10:38:35,911 INFO L226 Difference]: Without dead ends: 43 [2024-10-13 10:38:35,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-13 10:38:35,912 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:38:35,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 56 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:38:35,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-13 10:38:35,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-13 10:38:35,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 41 states have internal predecessors, (47), 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:38:35,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2024-10-13 10:38:35,920 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 22 [2024-10-13 10:38:35,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:38:35,921 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2024-10-13 10:38:35,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:38:35,921 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2024-10-13 10:38:35,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-13 10:38:35,922 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:38:35,923 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:38:35,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 10:38:36,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:38:36,124 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:38:36,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:38:36,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1440938028, now seen corresponding path program 2 times [2024-10-13 10:38:36,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:38:36,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168752185] [2024-10-13 10:38:36,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:38:36,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:38:36,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:38:36,404 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:38:36,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:38:36,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168752185] [2024-10-13 10:38:36,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168752185] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:38:36,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005969507] [2024-10-13 10:38:36,405 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:38:36,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:38:36,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:38:36,407 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:38:36,409 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:38:36,487 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 10:38:36,488 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:38:36,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 10:38:36,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:38:36,524 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-13 10:38:36,525 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:38:36,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005969507] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:38:36,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 10:38:36,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2024-10-13 10:38:36,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508299742] [2024-10-13 10:38:36,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:38:36,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:38:36,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:38:36,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:38:36,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:38:36,530 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:38:36,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:38:36,549 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2024-10-13 10:38:36,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:38:36,550 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-13 10:38:36,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:38:36,550 INFO L225 Difference]: With dead ends: 44 [2024-10-13 10:38:36,550 INFO L226 Difference]: Without dead ends: 44 [2024-10-13 10:38:36,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:38:36,551 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:38:36,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 54 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:38:36,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-13 10:38:36,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-13 10:38:36,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 38 states have (on average 1.263157894736842) internal successors, (48), 42 states have internal predecessors, (48), 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:38:36,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2024-10-13 10:38:36,558 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 23 [2024-10-13 10:38:36,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:38:36,558 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2024-10-13 10:38:36,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:38:36,558 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2024-10-13 10:38:36,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-13 10:38:36,558 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:38:36,558 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:38:36,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-13 10:38:36,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:38:36,759 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:38:36,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:38:36,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1089183695, now seen corresponding path program 1 times [2024-10-13 10:38:36,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:38:36,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159344671] [2024-10-13 10:38:36,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:38:36,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:38:36,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:38:37,065 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:38:37,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:38:37,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159344671] [2024-10-13 10:38:37,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159344671] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:38:37,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032620605] [2024-10-13 10:38:37,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:38:37,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:38:37,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:38:37,070 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:38:37,072 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:38:37,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:38:37,155 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-13 10:38:37,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:38:37,181 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:38:37,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-10-13 10:38:37,226 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:38:37,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2024-10-13 10:38:37,242 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:38:37,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2024-10-13 10:38:37,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:38:37,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 31 [2024-10-13 10:38:37,299 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:38:37,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2024-10-13 10:38:37,370 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:38:37,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 41 [2024-10-13 10:38:37,612 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:38:37,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 16 [2024-10-13 10:38:37,632 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:38:37,632 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:38:37,708 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:38:37,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032620605] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:38:37,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:38:37,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 8] total 19 [2024-10-13 10:38:37,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995633974] [2024-10-13 10:38:37,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:38:37,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-13 10:38:37,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:38:37,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-13 10:38:37,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2024-10-13 10:38:37,710 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:38:37,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:38:37,990 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2024-10-13 10:38:37,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 10:38:37,990 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-10-13 10:38:37,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:38:37,991 INFO L225 Difference]: With dead ends: 42 [2024-10-13 10:38:37,991 INFO L226 Difference]: Without dead ends: 42 [2024-10-13 10:38:37,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 33 SyntacticMatches, 9 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=402, Unknown=0, NotChecked=0, Total=552 [2024-10-13 10:38:37,992 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 11 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:38:37,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 114 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:38:37,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-13 10:38:37,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-13 10:38:37,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 40 states have internal predecessors, (45), 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:38:37,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2024-10-13 10:38:37,997 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 24 [2024-10-13 10:38:37,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:38:37,997 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2024-10-13 10:38:37,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:38:37,997 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2024-10-13 10:38:37,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 10:38:37,998 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:38:37,998 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] [2024-10-13 10:38:38,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-13 10:38:38,198 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,SelfDestructingSolverStorable13 [2024-10-13 10:38:38,199 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:38:38,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:38:38,200 INFO L85 PathProgramCache]: Analyzing trace with hash -457044023, now seen corresponding path program 1 times [2024-10-13 10:38:38,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:38:38,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119539707] [2024-10-13 10:38:38,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:38:38,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:38:38,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:38:38,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 10:38:38,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:38:38,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119539707] [2024-10-13 10:38:38,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119539707] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:38:38,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:38:38,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:38:38,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644670672] [2024-10-13 10:38:38,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:38:38,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:38:38,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:38:38,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:38:38,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:38:38,255 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:38:38,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:38:38,278 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2024-10-13 10:38:38,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:38:38,278 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-13 10:38:38,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:38:38,279 INFO L225 Difference]: With dead ends: 44 [2024-10-13 10:38:38,279 INFO L226 Difference]: Without dead ends: 44 [2024-10-13 10:38:38,279 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:38:38,279 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:38:38,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 79 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:38:38,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-13 10:38:38,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-13 10:38:38,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.205128205128205) internal successors, (47), 42 states have internal predecessors, (47), 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:38:38,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2024-10-13 10:38:38,282 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 26 [2024-10-13 10:38:38,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:38:38,285 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2024-10-13 10:38:38,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:38:38,286 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2024-10-13 10:38:38,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 10:38:38,286 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:38:38,286 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:38:38,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 10:38:38,287 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:38:38,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:38:38,287 INFO L85 PathProgramCache]: Analyzing trace with hash -455340809, now seen corresponding path program 1 times [2024-10-13 10:38:38,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:38:38,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866502932] [2024-10-13 10:38:38,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:38:38,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:38:38,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:38:38,525 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:38:38,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:38:38,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866502932] [2024-10-13 10:38:38,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866502932] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:38:38,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914201910] [2024-10-13 10:38:38,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:38:38,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:38:38,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:38:38,528 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:38:38,530 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:38:38,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:38:38,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-13 10:38:38,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:38:38,777 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 10:38:38,777 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:38:38,952 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:38:38,952 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 13 treesize of output 17 [2024-10-13 10:38:38,988 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 10:38:38,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914201910] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:38:38,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:38:38,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2024-10-13 10:38:38,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670313519] [2024-10-13 10:38:38,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:38:38,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-13 10:38:38,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:38:38,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-13 10:38:38,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-10-13 10:38:38,990 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 16 states, 16 states have (on average 4.625) internal successors, (74), 16 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:38:39,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:38:39,245 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2024-10-13 10:38:39,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 10:38:39,246 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.625) internal successors, (74), 16 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-13 10:38:39,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:38:39,246 INFO L225 Difference]: With dead ends: 50 [2024-10-13 10:38:39,246 INFO L226 Difference]: Without dead ends: 50 [2024-10-13 10:38:39,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2024-10-13 10:38:39,247 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 23 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:38:39,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 92 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:38:39,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-13 10:38:39,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-13 10:38:39,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.2) internal successors, (54), 48 states have internal predecessors, (54), 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:38:39,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2024-10-13 10:38:39,254 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 26 [2024-10-13 10:38:39,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:38:39,254 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2024-10-13 10:38:39,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.625) internal successors, (74), 16 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:38:39,255 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2024-10-13 10:38:39,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-13 10:38:39,255 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:38:39,255 INFO L215 NwaCegarLoop]: trace histogram [3, 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:38:39,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-13 10:38:39,459 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,SelfDestructingSolverStorable15 [2024-10-13 10:38:39,460 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:38:39,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:38:39,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1563209628, now seen corresponding path program 1 times [2024-10-13 10:38:39,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:38:39,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259842222] [2024-10-13 10:38:39,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:38:39,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:38:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:38:39,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-13 10:38:39,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:38:39,720 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:38:39,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:38:39,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259842222] [2024-10-13 10:38:39,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259842222] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:38:39,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767148473] [2024-10-13 10:38:39,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:38:39,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:38:39,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:38:39,723 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:38:39,724 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:38:39,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:38:39,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-13 10:38:39,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:38:39,854 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:38:39,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-10-13 10:38:39,885 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:38:39,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 36 treesize of output 23 [2024-10-13 10:38:39,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:38:39,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 30 treesize of output 32 [2024-10-13 10:38:39,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:38:39,923 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 3 case distinctions, treesize of input 45 treesize of output 35 [2024-10-13 10:38:39,937 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:38:39,938 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 3 case distinctions, treesize of input 39 treesize of output 44 [2024-10-13 10:38:39,978 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:38:39,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 47 [2024-10-13 10:38:40,134 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:38:40,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 16 [2024-10-13 10:38:40,154 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:38:40,154 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:38:40,239 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:38:40,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767148473] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:38:40,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:38:40,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 7] total 15 [2024-10-13 10:38:40,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675744552] [2024-10-13 10:38:40,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:38:40,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 10:38:40,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:38:40,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 10:38:40,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-10-13 10:38:40,242 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:38:40,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:38:40,460 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2024-10-13 10:38:40,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 10:38:40,461 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2024-10-13 10:38:40,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:38:40,461 INFO L225 Difference]: With dead ends: 50 [2024-10-13 10:38:40,462 INFO L226 Difference]: Without dead ends: 50 [2024-10-13 10:38:40,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 54 SyntacticMatches, 9 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2024-10-13 10:38:40,462 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 60 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:38:40,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 84 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:38:40,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-13 10:38:40,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-13 10:38:40,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 48 states have internal predecessors, (53), 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:38:40,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2024-10-13 10:38:40,466 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 32 [2024-10-13 10:38:40,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:38:40,466 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2024-10-13 10:38:40,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:38:40,466 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2024-10-13 10:38:40,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-13 10:38:40,467 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:38:40,467 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 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:38:40,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-13 10:38:40,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:38:40,668 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:38:40,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:38:40,669 INFO L85 PathProgramCache]: Analyzing trace with hash 107940147, now seen corresponding path program 2 times [2024-10-13 10:38:40,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:38:40,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817473194] [2024-10-13 10:38:40,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:38:40,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:38:40,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:38:40,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 10:38:40,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:38:40,962 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-13 10:38:40,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:38:40,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817473194] [2024-10-13 10:38:40,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817473194] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:38:40,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536502875] [2024-10-13 10:38:40,962 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:38:40,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:38:40,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:38:40,964 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:38:40,966 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:38:41,056 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 10:38:41,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:38:41,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-13 10:38:41,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:38:41,070 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:38:41,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-10-13 10:38:41,094 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:38:41,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 36 treesize of output 23 [2024-10-13 10:38:41,104 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:38:41,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 30 treesize of output 32 [2024-10-13 10:38:41,128 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:38:41,129 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 3 case distinctions, treesize of input 45 treesize of output 35 [2024-10-13 10:38:41,146 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:38:41,146 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 3 case distinctions, treesize of input 39 treesize of output 44 [2024-10-13 10:38:41,180 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:38:41,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 47 [2024-10-13 10:38:41,318 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:38:41,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 16 [2024-10-13 10:38:41,332 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 10:38:41,333 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:38:41,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536502875] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:38:41,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 10:38:41,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [6] total 11 [2024-10-13 10:38:41,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312754423] [2024-10-13 10:38:41,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:38:41,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:38:41,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:38:41,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:38:41,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-13 10:38:41,334 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:38:41,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:38:41,414 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2024-10-13 10:38:41,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:38:41,414 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2024-10-13 10:38:41,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:38:41,415 INFO L225 Difference]: With dead ends: 48 [2024-10-13 10:38:41,415 INFO L226 Difference]: Without dead ends: 48 [2024-10-13 10:38:41,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-13 10:38:41,416 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 3 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:38:41,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 71 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:38:41,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-13 10:38:41,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-13 10:38:41,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 46 states have internal predecessors, (50), 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:38:41,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2024-10-13 10:38:41,418 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 35 [2024-10-13 10:38:41,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:38:41,418 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2024-10-13 10:38:41,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:38:41,422 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2024-10-13 10:38:41,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-13 10:38:41,423 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:38:41,423 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:38:41,442 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:38:41,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-13 10:38:41,624 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:38:41,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:38:41,624 INFO L85 PathProgramCache]: Analyzing trace with hash -609601401, now seen corresponding path program 1 times [2024-10-13 10:38:41,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:38:41,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766938608] [2024-10-13 10:38:41,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:38:41,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:38:41,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:38:41,952 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-13 10:38:41,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:38:41,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766938608] [2024-10-13 10:38:41,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766938608] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:38:41,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662545473] [2024-10-13 10:38:41,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:38:41,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:38:41,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:38:41,954 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:38:41,956 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:38:42,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:38:42,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-13 10:38:42,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:38:42,059 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:38:42,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-10-13 10:38:42,097 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:38:42,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 38 treesize of output 25 [2024-10-13 10:38:42,188 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:38:42,188 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 28 treesize of output 10 [2024-10-13 10:38:42,211 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 10:38:42,212 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:38:42,296 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 10:38:42,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662545473] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:38:42,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:38:42,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 18 [2024-10-13 10:38:42,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554303702] [2024-10-13 10:38:42,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:38:42,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-13 10:38:42,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:38:42,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-13 10:38:42,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-10-13 10:38:42,298 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:38:42,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:38:42,530 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2024-10-13 10:38:42,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 10:38:42,533 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-10-13 10:38:42,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:38:42,533 INFO L225 Difference]: With dead ends: 50 [2024-10-13 10:38:42,533 INFO L226 Difference]: Without dead ends: 50 [2024-10-13 10:38:42,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2024-10-13 10:38:42,534 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 10 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:38:42,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 142 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:38:42,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-13 10:38:42,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-13 10:38:42,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 48 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:38:42,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2024-10-13 10:38:42,537 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 35 [2024-10-13 10:38:42,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:38:42,537 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2024-10-13 10:38:42,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:38:42,537 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2024-10-13 10:38:42,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-13 10:38:42,538 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:38:42,538 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:38:42,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-13 10:38:42,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:38:42,738 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:38:42,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:38:42,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1983193559, now seen corresponding path program 2 times [2024-10-13 10:38:42,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:38:42,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440902790] [2024-10-13 10:38:42,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:38:42,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:38:42,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:38:43,102 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-13 10:38:43,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:38:43,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440902790] [2024-10-13 10:38:43,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440902790] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:38:43,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100043604] [2024-10-13 10:38:43,102 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:38:43,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:38:43,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:38:43,104 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:38:43,105 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:38:43,224 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:38:43,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:38:43,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-13 10:38:43,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:38:43,266 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 8 treesize of output 1 [2024-10-13 10:38:43,608 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 15 treesize of output 7 [2024-10-13 10:38:43,626 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:38:43,626 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:38:43,821 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:38:43,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100043604] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:38:43,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:38:43,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 27 [2024-10-13 10:38:43,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480280222] [2024-10-13 10:38:43,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:38:43,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-13 10:38:43,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:38:43,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-13 10:38:43,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=581, Unknown=0, NotChecked=0, Total=702 [2024-10-13 10:38:43,824 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 27 states, 27 states have (on average 3.3703703703703702) internal successors, (91), 27 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:38:44,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:38:44,173 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2024-10-13 10:38:44,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 10:38:44,173 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.3703703703703702) internal successors, (91), 27 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-10-13 10:38:44,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:38:44,174 INFO L225 Difference]: With dead ends: 48 [2024-10-13 10:38:44,174 INFO L226 Difference]: Without dead ends: 48 [2024-10-13 10:38:44,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=291, Invalid=1115, Unknown=0, NotChecked=0, Total=1406 [2024-10-13 10:38:44,175 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 18 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:38:44,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 116 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:38:44,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-13 10:38:44,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-13 10:38:44,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 46 states have internal predecessors, (48), 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:38:44,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2024-10-13 10:38:44,178 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 38 [2024-10-13 10:38:44,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:38:44,178 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2024-10-13 10:38:44,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.3703703703703702) internal successors, (91), 27 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:38:44,179 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2024-10-13 10:38:44,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-13 10:38:44,179 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:38:44,179 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:38:44,196 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:38:44,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:38:44,384 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:38:44,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:38:44,384 INFO L85 PathProgramCache]: Analyzing trace with hash 466025971, now seen corresponding path program 1 times [2024-10-13 10:38:44,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:38:44,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859007100] [2024-10-13 10:38:44,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:38:44,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:38:44,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:38:44,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 10:38:44,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:38:44,719 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-13 10:38:44,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:38:44,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859007100] [2024-10-13 10:38:44,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859007100] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:38:44,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525770086] [2024-10-13 10:38:44,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:38:44,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:38:44,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:38:44,722 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:38:44,723 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:38:44,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:38:44,824 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-13 10:38:44,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:38:44,832 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:38:44,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-10-13 10:38:44,860 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:38:44,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 36 treesize of output 23 [2024-10-13 10:38:44,871 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:38:44,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 30 treesize of output 32 [2024-10-13 10:38:44,897 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:38:44,897 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 3 case distinctions, treesize of input 45 treesize of output 35 [2024-10-13 10:38:44,916 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:38:44,916 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 3 case distinctions, treesize of input 39 treesize of output 44 [2024-10-13 10:38:44,941 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:38:44,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 47 [2024-10-13 10:38:45,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:38:45,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 16 [2024-10-13 10:38:45,179 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 10:38:45,180 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:38:45,291 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 10:38:45,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525770086] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:38:45,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:38:45,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 7] total 20 [2024-10-13 10:38:45,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959743540] [2024-10-13 10:38:45,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:38:45,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-13 10:38:45,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:38:45,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-13 10:38:45,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2024-10-13 10:38:45,293 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 20 states, 20 states have (on average 3.85) internal successors, (77), 20 states have internal predecessors, (77), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:38:45,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:38:45,562 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2024-10-13 10:38:45,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 10:38:45,563 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.85) internal successors, (77), 20 states have internal predecessors, (77), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2024-10-13 10:38:45,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:38:45,563 INFO L225 Difference]: With dead ends: 46 [2024-10-13 10:38:45,563 INFO L226 Difference]: Without dead ends: 46 [2024-10-13 10:38:45,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 71 SyntacticMatches, 7 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=699, Unknown=0, NotChecked=0, Total=870 [2024-10-13 10:38:45,564 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 8 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:38:45,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 149 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:38:45,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-13 10:38:45,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-13 10:38:45,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 44 states have internal predecessors, (45), 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:38:45,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2024-10-13 10:38:45,567 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 41 [2024-10-13 10:38:45,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:38:45,567 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2024-10-13 10:38:45,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.85) internal successors, (77), 20 states have internal predecessors, (77), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:38:45,568 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2024-10-13 10:38:45,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-13 10:38:45,580 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:38:45,580 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 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:38:45,604 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:38:45,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-10-13 10:38:45,786 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:38:45,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:38:45,786 INFO L85 PathProgramCache]: Analyzing trace with hash -251515577, now seen corresponding path program 2 times [2024-10-13 10:38:45,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:38:45,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448404336] [2024-10-13 10:38:45,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:38:45,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:38:45,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:38:45,973 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-13 10:38:45,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:38:45,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448404336] [2024-10-13 10:38:45,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448404336] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:38:45,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680820658] [2024-10-13 10:38:45,974 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:38:45,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:38:45,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:38:45,975 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:38:45,977 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:38:46,154 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:38:46,154 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:38:46,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 10:38:46,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:38:46,170 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-13 10:38:46,171 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:38:46,204 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-13 10:38:46,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680820658] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:38:46,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:38:46,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-10-13 10:38:46,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750361890] [2024-10-13 10:38:46,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:38:46,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 10:38:46,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:38:46,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 10:38:46,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-10-13 10:38:46,206 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:38:46,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:38:46,262 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2024-10-13 10:38:46,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:38:46,263 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-10-13 10:38:46,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:38:46,263 INFO L225 Difference]: With dead ends: 49 [2024-10-13 10:38:46,263 INFO L226 Difference]: Without dead ends: 49 [2024-10-13 10:38:46,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-13 10:38:46,264 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 4 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:38:46,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 173 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:38:46,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-13 10:38:46,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-10-13 10:38:46,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 47 states have internal predecessors, (48), 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:38:46,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2024-10-13 10:38:46,266 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 41 [2024-10-13 10:38:46,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:38:46,267 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2024-10-13 10:38:46,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:38:46,267 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2024-10-13 10:38:46,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-13 10:38:46,267 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:38:46,267 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:38:46,284 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:38:46,468 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,SelfDestructingSolverStorable21 [2024-10-13 10:38:46,468 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:38:46,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:38:46,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1713997460, now seen corresponding path program 3 times [2024-10-13 10:38:46,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:38:46,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120189126] [2024-10-13 10:38:46,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:38:46,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:38:46,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:38:46,683 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-13 10:38:46,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:38:46,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120189126] [2024-10-13 10:38:46,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120189126] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:38:46,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748986965] [2024-10-13 10:38:46,683 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 10:38:46,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:38:46,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:38:46,685 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:38:46,686 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:38:46,911 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-13 10:38:46,911 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:38:46,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 10:38:46,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:38:46,967 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-13 10:38:46,968 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:38:47,088 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-13 10:38:47,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748986965] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:38:47,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:38:47,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2024-10-13 10:38:47,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142655124] [2024-10-13 10:38:47,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:38:47,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-13 10:38:47,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:38:47,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-13 10:38:47,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=202, Unknown=0, NotChecked=0, Total=306 [2024-10-13 10:38:47,091 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:38:47,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:38:47,312 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2024-10-13 10:38:47,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 10:38:47,312 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-10-13 10:38:47,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:38:47,313 INFO L225 Difference]: With dead ends: 55 [2024-10-13 10:38:47,313 INFO L226 Difference]: Without dead ends: 55 [2024-10-13 10:38:47,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=332, Unknown=0, NotChecked=0, Total=506 [2024-10-13 10:38:47,314 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 7 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:38:47,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 199 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:38:47,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-13 10:38:47,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-13 10:38:47,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 53 states have internal predecessors, (54), 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:38:47,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2024-10-13 10:38:47,316 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 44 [2024-10-13 10:38:47,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:38:47,316 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2024-10-13 10:38:47,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:38:47,316 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2024-10-13 10:38:47,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-13 10:38:47,317 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:38:47,317 INFO L215 NwaCegarLoop]: trace histogram [10, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:38:47,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-13 10:38:47,521 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,SelfDestructingSolverStorable22 [2024-10-13 10:38:47,522 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:38:47,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:38:47,522 INFO L85 PathProgramCache]: Analyzing trace with hash 735140748, now seen corresponding path program 4 times [2024-10-13 10:38:47,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:38:47,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928058447] [2024-10-13 10:38:47,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:38:47,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:38:47,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:38:47,903 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-13 10:38:47,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:38:47,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928058447] [2024-10-13 10:38:47,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928058447] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:38:47,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098992271] [2024-10-13 10:38:47,904 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 10:38:47,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:38:47,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:38:47,907 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:38:47,908 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:38:48,059 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 10:38:48,059 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:38:48,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-13 10:38:48,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:38:48,284 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-13 10:38:48,284 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:38:48,619 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-13 10:38:48,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098992271] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:38:48,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:38:48,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 35 [2024-10-13 10:38:48,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241897139] [2024-10-13 10:38:48,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:38:48,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-10-13 10:38:48,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:38:48,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-10-13 10:38:48,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=898, Unknown=0, NotChecked=0, Total=1260 [2024-10-13 10:38:48,622 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand has 36 states, 36 states have (on average 1.6944444444444444) internal successors, (61), 35 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:38:50,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:38:50,958 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2024-10-13 10:38:50,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-13 10:38:50,959 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.6944444444444444) internal successors, (61), 35 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-10-13 10:38:50,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:38:50,959 INFO L225 Difference]: With dead ends: 67 [2024-10-13 10:38:50,959 INFO L226 Difference]: Without dead ends: 67 [2024-10-13 10:38:50,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=648, Invalid=1514, Unknown=0, NotChecked=0, Total=2162 [2024-10-13 10:38:50,961 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 26 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:38:50,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 374 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:38:50,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-13 10:38:50,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-13 10:38:50,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 65 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:38:50,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2024-10-13 10:38:50,963 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 50 [2024-10-13 10:38:50,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:38:50,964 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2024-10-13 10:38:50,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.6944444444444444) internal successors, (61), 35 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:38:50,964 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2024-10-13 10:38:50,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-13 10:38:50,965 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:38:50,965 INFO L215 NwaCegarLoop]: trace histogram [22, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:38:50,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-10-13 10:38:51,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:38:51,166 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-13 10:38:51,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:38:51,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1636116532, now seen corresponding path program 5 times [2024-10-13 10:38:51,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:38:51,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151044062] [2024-10-13 10:38:51,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:38:51,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:38:51,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:38:52,053 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-13 10:38:52,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:38:52,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151044062] [2024-10-13 10:38:52,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151044062] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:38:52,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134087447] [2024-10-13 10:38:52,054 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-13 10:38:52,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:38:52,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:38:52,056 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:38:52,060 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:38:52,903 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2024-10-13 10:38:52,903 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:38:52,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-10-13 10:38:52,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:38:53,557 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-13 10:38:53,557 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:38:54,728 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-13 10:38:54,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134087447] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:38:54,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:38:54,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 71 [2024-10-13 10:38:54,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70164111] [2024-10-13 10:38:54,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:38:54,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2024-10-13 10:38:54,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:38:54,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2024-10-13 10:38:54,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1310, Invalid=3802, Unknown=0, NotChecked=0, Total=5112 [2024-10-13 10:38:54,733 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand has 72 states, 72 states have (on average 1.3472222222222223) internal successors, (97), 71 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)