./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrcspn_mixed_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrcspn_mixed_alloca.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash f2e994fbd4308fecf33fa0184f8cdc44b0ef95d4019fc8f460440561d10a29a6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:52:12,126 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:52:12,187 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-10-11 17:52:12,193 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:52:12,195 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:52:12,214 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:52:12,215 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:52:12,215 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:52:12,216 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 17:52:12,216 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 17:52:12,216 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:52:12,217 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:52:12,217 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:52:12,218 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:52:12,218 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:52:12,218 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:52:12,219 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:52:12,219 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:52:12,219 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 17:52:12,220 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 17:52:12,220 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 17:52:12,221 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:52:12,221 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 17:52:12,221 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:52:12,222 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:52:12,222 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:52:12,222 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:52:12,223 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:52:12,223 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 17:52:12,223 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:52:12,224 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:52:12,224 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:52:12,224 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:52:12,225 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:52:12,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:52:12,225 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:52:12,225 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:52:12,226 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:52:12,226 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:52:12,226 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-clean/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-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f2e994fbd4308fecf33fa0184f8cdc44b0ef95d4019fc8f460440561d10a29a6 [2024-10-11 17:52:12,497 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:52:12,524 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:52:12,527 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:52:12,529 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:52:12,530 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:52:12,531 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrcspn_mixed_alloca.i [2024-10-11 17:52:13,951 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:52:14,186 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:52:14,186 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrcspn_mixed_alloca.i [2024-10-11 17:52:14,197 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c7117a56d/1985fd108f854397b9d2aa9a08f35da6/FLAG8d2e66686 [2024-10-11 17:52:14,520 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c7117a56d/1985fd108f854397b9d2aa9a08f35da6 [2024-10-11 17:52:14,524 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:52:14,525 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:52:14,526 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:52:14,526 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:52:14,532 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:52:14,533 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:52:14" (1/1) ... [2024-10-11 17:52:14,534 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6017d7bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:52:14, skipping insertion in model container [2024-10-11 17:52:14,534 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:52:14" (1/1) ... [2024-10-11 17:52:14,579 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:52:14,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:52:14,905 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:52:14,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:52:14,974 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:52:14,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:52:14 WrapperNode [2024-10-11 17:52:14,975 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:52:14,976 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:52:14,976 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:52:14,976 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:52:14,983 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:52:14" (1/1) ... [2024-10-11 17:52:14,994 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:52:14" (1/1) ... [2024-10-11 17:52:15,017 INFO L138 Inliner]: procedures = 152, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 82 [2024-10-11 17:52:15,018 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:52:15,018 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:52:15,019 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:52:15,019 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:52:15,029 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:52:14" (1/1) ... [2024-10-11 17:52:15,029 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:52:14" (1/1) ... [2024-10-11 17:52:15,032 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:52:14" (1/1) ... [2024-10-11 17:52:15,052 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [3, 4]. 57 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 2 writes are split as follows [1, 1]. [2024-10-11 17:52:15,052 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:52:14" (1/1) ... [2024-10-11 17:52:15,053 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:52:14" (1/1) ... [2024-10-11 17:52:15,065 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:52:14" (1/1) ... [2024-10-11 17:52:15,068 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:52:14" (1/1) ... [2024-10-11 17:52:15,070 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:52:14" (1/1) ... [2024-10-11 17:52:15,071 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:52:14" (1/1) ... [2024-10-11 17:52:15,072 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:52:15,073 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:52:15,073 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:52:15,074 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:52:15,077 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:52:14" (1/1) ... [2024-10-11 17:52:15,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:52:15,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:52:15,117 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:52:15,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:52:15,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 17:52:15,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 17:52:15,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 17:52:15,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 17:52:15,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 17:52:15,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:52:15,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:52:15,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:52:15,289 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:52:15,291 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:52:15,500 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2024-10-11 17:52:15,500 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:52:15,532 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:52:15,532 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 17:52:15,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:52:15 BoogieIcfgContainer [2024-10-11 17:52:15,533 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:52:15,534 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:52:15,534 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:52:15,542 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:52:15,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:52:14" (1/3) ... [2024-10-11 17:52:15,543 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@141d083e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:52:15, skipping insertion in model container [2024-10-11 17:52:15,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:52:14" (2/3) ... [2024-10-11 17:52:15,543 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@141d083e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:52:15, skipping insertion in model container [2024-10-11 17:52:15,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:52:15" (3/3) ... [2024-10-11 17:52:15,545 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrcspn_mixed_alloca.i [2024-10-11 17:52:15,562 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:52:15,563 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 15 error locations. [2024-10-11 17:52:15,614 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:52:15,622 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;@274faac7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:52:15,623 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-10-11 17:52:15,628 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 33 states have internal predecessors, (41), 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-11 17:52:15,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 17:52:15,634 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:52:15,635 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 17:52:15,637 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-11 17:52:15,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:52:15,643 INFO L85 PathProgramCache]: Analyzing trace with hash 107288444, now seen corresponding path program 1 times [2024-10-11 17:52:15,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:52:15,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332593575] [2024-10-11 17:52:15,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:52:15,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:52:15,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:52:15,983 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-11 17:52:15,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:52:15,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332593575] [2024-10-11 17:52:15,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332593575] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:52:15,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:52:15,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:52:15,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820558948] [2024-10-11 17:52:15,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:52:15,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:52:15,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:52:16,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:52:16,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:52:16,011 INFO L87 Difference]: Start difference. First operand has 34 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 33 states have internal predecessors, (41), 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) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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-11 17:52:16,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:52:16,066 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2024-10-11 17:52:16,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:52:16,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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-11 17:52:16,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:52:16,075 INFO L225 Difference]: With dead ends: 33 [2024-10-11 17:52:16,076 INFO L226 Difference]: Without dead ends: 32 [2024-10-11 17:52:16,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:52:16,080 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 3 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:52:16,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 45 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:52:16,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-11 17:52:16,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-11 17:52:16,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 31 states have internal predecessors, (37), 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-11 17:52:16,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2024-10-11 17:52:16,111 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 5 [2024-10-11 17:52:16,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:52:16,112 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2024-10-11 17:52:16,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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-11 17:52:16,112 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2024-10-11 17:52:16,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 17:52:16,113 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:52:16,113 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 17:52:16,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:52:16,113 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-11 17:52:16,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:52:16,114 INFO L85 PathProgramCache]: Analyzing trace with hash 107288445, now seen corresponding path program 1 times [2024-10-11 17:52:16,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:52:16,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410608365] [2024-10-11 17:52:16,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:52:16,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:52:16,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:52:16,412 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-11 17:52:16,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:52:16,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410608365] [2024-10-11 17:52:16,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410608365] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:52:16,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:52:16,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:52:16,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259358340] [2024-10-11 17:52:16,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:52:16,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:52:16,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:52:16,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:52:16,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:52:16,417 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) 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-11 17:52:16,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:52:16,455 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2024-10-11 17:52:16,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:52:16,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) 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-11 17:52:16,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:52:16,457 INFO L225 Difference]: With dead ends: 35 [2024-10-11 17:52:16,457 INFO L226 Difference]: Without dead ends: 35 [2024-10-11 17:52:16,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:52:16,458 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:52:16,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 57 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:52:16,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-11 17:52:16,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-11 17:52:16,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 34 states have internal predecessors, (41), 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-11 17:52:16,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2024-10-11 17:52:16,468 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 5 [2024-10-11 17:52:16,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:52:16,469 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-10-11 17:52:16,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) 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-11 17:52:16,469 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2024-10-11 17:52:16,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 17:52:16,469 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:52:16,469 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 17:52:16,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:52:16,470 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-11 17:52:16,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:52:16,470 INFO L85 PathProgramCache]: Analyzing trace with hash 107348027, now seen corresponding path program 1 times [2024-10-11 17:52:16,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:52:16,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012756986] [2024-10-11 17:52:16,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:52:16,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:52:16,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:52:16,715 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-11 17:52:16,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:52:16,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012756986] [2024-10-11 17:52:16,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012756986] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:52:16,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:52:16,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:52:16,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795577974] [2024-10-11 17:52:16,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:52:16,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:52:16,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:52:16,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:52:16,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:52:16,724 INFO L87 Difference]: Start difference. First operand 35 states and 41 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-11 17:52:16,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:52:16,790 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2024-10-11 17:52:16,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:52:16,791 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-11 17:52:16,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:52:16,791 INFO L225 Difference]: With dead ends: 34 [2024-10-11 17:52:16,791 INFO L226 Difference]: Without dead ends: 34 [2024-10-11 17:52:16,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:52:16,793 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:52:16,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 76 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:52:16,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-11 17:52:16,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2024-10-11 17:52:16,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 18 states have (on average 2.0) internal successors, (36), 30 states have internal predecessors, (36), 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-11 17:52:16,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2024-10-11 17:52:16,799 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 5 [2024-10-11 17:52:16,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:52:16,801 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2024-10-11 17:52:16,801 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-11 17:52:16,801 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2024-10-11 17:52:16,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 17:52:16,801 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:52:16,801 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 17:52:16,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:52:16,802 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-11 17:52:16,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:52:16,804 INFO L85 PathProgramCache]: Analyzing trace with hash -969025543, now seen corresponding path program 1 times [2024-10-11 17:52:16,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:52:16,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833604568] [2024-10-11 17:52:16,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:52:16,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:52:16,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:52:16,851 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-11 17:52:16,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:52:16,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833604568] [2024-10-11 17:52:16,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833604568] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:52:16,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:52:16,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:52:16,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382208750] [2024-10-11 17:52:16,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:52:16,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:52:16,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:52:16,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:52:16,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:52:16,855 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:16,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:52:16,893 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2024-10-11 17:52:16,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:52:16,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-11 17:52:16,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:52:16,895 INFO L225 Difference]: With dead ends: 30 [2024-10-11 17:52:16,895 INFO L226 Difference]: Without dead ends: 30 [2024-10-11 17:52:16,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:52:16,896 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:52:16,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:52:16,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-11 17:52:16,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-11 17:52:16,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 29 states have internal predecessors, (35), 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-11 17:52:16,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2024-10-11 17:52:16,902 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 6 [2024-10-11 17:52:16,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:52:16,903 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-10-11 17:52:16,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:16,903 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2024-10-11 17:52:16,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 17:52:16,904 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:52:16,904 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 17:52:16,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:52:16,904 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-11 17:52:16,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:52:16,905 INFO L85 PathProgramCache]: Analyzing trace with hash -969025542, now seen corresponding path program 1 times [2024-10-11 17:52:16,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:52:16,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911916242] [2024-10-11 17:52:16,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:52:16,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:52:16,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:52:17,001 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-11 17:52:17,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:52:17,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911916242] [2024-10-11 17:52:17,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911916242] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:52:17,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:52:17,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:52:17,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145986967] [2024-10-11 17:52:17,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:52:17,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:52:17,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:52:17,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:52:17,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:52:17,005 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:17,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:52:17,072 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2024-10-11 17:52:17,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:52:17,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-11 17:52:17,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:52:17,073 INFO L225 Difference]: With dead ends: 33 [2024-10-11 17:52:17,074 INFO L226 Difference]: Without dead ends: 33 [2024-10-11 17:52:17,074 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-11 17:52:17,075 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:52:17,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 72 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:52:17,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-11 17:52:17,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-11 17:52:17,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 32 states have internal predecessors, (38), 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-11 17:52:17,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2024-10-11 17:52:17,081 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 6 [2024-10-11 17:52:17,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:52:17,081 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2024-10-11 17:52:17,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:17,081 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2024-10-11 17:52:17,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 17:52:17,082 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:52:17,082 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 17:52:17,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:52:17,082 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-11 17:52:17,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:52:17,083 INFO L85 PathProgramCache]: Analyzing trace with hash -968965960, now seen corresponding path program 1 times [2024-10-11 17:52:17,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:52:17,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312441712] [2024-10-11 17:52:17,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:52:17,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:52:17,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:52:17,206 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-11 17:52:17,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:52:17,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312441712] [2024-10-11 17:52:17,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312441712] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:52:17,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:52:17,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:52:17,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084282512] [2024-10-11 17:52:17,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:52:17,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:52:17,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:52:17,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:52:17,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:52:17,208 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:17,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:52:17,258 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2024-10-11 17:52:17,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:52:17,259 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-11 17:52:17,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:52:17,260 INFO L225 Difference]: With dead ends: 32 [2024-10-11 17:52:17,260 INFO L226 Difference]: Without dead ends: 32 [2024-10-11 17:52:17,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:52:17,261 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 3 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:52:17,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 87 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:52:17,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-11 17:52:17,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2024-10-11 17:52:17,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 28 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-11 17:52:17,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2024-10-11 17:52:17,266 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 6 [2024-10-11 17:52:17,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:52:17,266 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2024-10-11 17:52:17,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:17,266 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2024-10-11 17:52:17,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 17:52:17,267 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:52:17,267 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:52:17,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:52:17,267 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-11 17:52:17,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:52:17,268 INFO L85 PathProgramCache]: Analyzing trace with hash 24981250, now seen corresponding path program 1 times [2024-10-11 17:52:17,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:52:17,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804770192] [2024-10-11 17:52:17,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:52:17,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:52:17,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:52:17,308 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-11 17:52:17,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:52:17,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804770192] [2024-10-11 17:52:17,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804770192] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:52:17,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:52:17,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:52:17,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355969868] [2024-10-11 17:52:17,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:52:17,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:52:17,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:52:17,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:52:17,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:52:17,310 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:17,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:52:17,345 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2024-10-11 17:52:17,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:52:17,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 17:52:17,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:52:17,346 INFO L225 Difference]: With dead ends: 27 [2024-10-11 17:52:17,347 INFO L226 Difference]: Without dead ends: 27 [2024-10-11 17:52:17,347 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-11 17:52:17,348 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 19 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:52:17,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 36 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:52:17,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-11 17:52:17,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-11 17:52:17,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 26 states have internal predecessors, (32), 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-11 17:52:17,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2024-10-11 17:52:17,351 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 7 [2024-10-11 17:52:17,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:52:17,351 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2024-10-11 17:52:17,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:17,351 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2024-10-11 17:52:17,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 17:52:17,351 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:52:17,352 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:52:17,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:52:17,352 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-11 17:52:17,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:52:17,353 INFO L85 PathProgramCache]: Analyzing trace with hash 24981251, now seen corresponding path program 1 times [2024-10-11 17:52:17,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:52:17,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560609029] [2024-10-11 17:52:17,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:52:17,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:52:17,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:52:17,463 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-11 17:52:17,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:52:17,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560609029] [2024-10-11 17:52:17,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560609029] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:52:17,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:52:17,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:52:17,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212418269] [2024-10-11 17:52:17,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:52:17,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:52:17,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:52:17,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:52:17,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:52:17,465 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:17,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:52:17,537 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2024-10-11 17:52:17,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:52:17,538 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 17:52:17,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:52:17,539 INFO L225 Difference]: With dead ends: 43 [2024-10-11 17:52:17,539 INFO L226 Difference]: Without dead ends: 43 [2024-10-11 17:52:17,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:52:17,540 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 18 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:52:17,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 74 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:52:17,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-11 17:52:17,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2024-10-11 17:52:17,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 29 states have internal predecessors, (36), 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-11 17:52:17,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2024-10-11 17:52:17,548 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 7 [2024-10-11 17:52:17,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:52:17,548 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2024-10-11 17:52:17,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:17,552 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2024-10-11 17:52:17,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 17:52:17,552 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:52:17,553 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:52:17,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:52:17,553 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-11 17:52:17,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:52:17,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1187081204, now seen corresponding path program 1 times [2024-10-11 17:52:17,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:52:17,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904101111] [2024-10-11 17:52:17,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:52:17,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:52:17,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:52:17,611 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-11 17:52:17,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:52:17,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904101111] [2024-10-11 17:52:17,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904101111] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:52:17,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:52:17,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:52:17,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472094133] [2024-10-11 17:52:17,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:52:17,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:52:17,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:52:17,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:52:17,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:52:17,614 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:17,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:52:17,652 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2024-10-11 17:52:17,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:52:17,653 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-11 17:52:17,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:52:17,653 INFO L225 Difference]: With dead ends: 27 [2024-10-11 17:52:17,653 INFO L226 Difference]: Without dead ends: 27 [2024-10-11 17:52:17,654 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-11 17:52:17,654 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 24 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:52:17,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 27 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:52:17,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-11 17:52:17,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-11 17:52:17,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 26 states have internal predecessors, (33), 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-11 17:52:17,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2024-10-11 17:52:17,657 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 10 [2024-10-11 17:52:17,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:52:17,657 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-10-11 17:52:17,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:17,657 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2024-10-11 17:52:17,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 17:52:17,658 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:52:17,658 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:52:17,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:52:17,658 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-11 17:52:17,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:52:17,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1187081205, now seen corresponding path program 1 times [2024-10-11 17:52:17,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:52:17,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139577175] [2024-10-11 17:52:17,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:52:17,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:52:17,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:52:17,812 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-11 17:52:17,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:52:17,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139577175] [2024-10-11 17:52:17,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139577175] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:52:17,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:52:17,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:52:17,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959140131] [2024-10-11 17:52:17,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:52:17,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:52:17,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:52:17,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:52:17,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:52:17,816 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:17,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:52:17,903 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2024-10-11 17:52:17,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 17:52:17,903 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-11 17:52:17,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:52:17,904 INFO L225 Difference]: With dead ends: 46 [2024-10-11 17:52:17,905 INFO L226 Difference]: Without dead ends: 46 [2024-10-11 17:52:17,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:52:17,906 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 27 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:52:17,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 54 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:52:17,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-11 17:52:17,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2024-10-11 17:52:17,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 40 states have internal predecessors, (55), 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-11 17:52:17,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2024-10-11 17:52:17,910 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 55 transitions. Word has length 10 [2024-10-11 17:52:17,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:52:17,910 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 55 transitions. [2024-10-11 17:52:17,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:17,910 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 55 transitions. [2024-10-11 17:52:17,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 17:52:17,910 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:52:17,910 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:52:17,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:52:17,911 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-11 17:52:17,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:52:17,911 INFO L85 PathProgramCache]: Analyzing trace with hash 377734579, now seen corresponding path program 1 times [2024-10-11 17:52:17,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:52:17,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212647561] [2024-10-11 17:52:17,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:52:17,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:52:17,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:52:18,094 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-11 17:52:18,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:52:18,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212647561] [2024-10-11 17:52:18,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212647561] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:52:18,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:52:18,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:52:18,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158299403] [2024-10-11 17:52:18,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:52:18,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:52:18,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:52:18,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:52:18,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:52:18,097 INFO L87 Difference]: Start difference. First operand 41 states and 55 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:18,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:52:18,178 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2024-10-11 17:52:18,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 17:52:18,179 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-11 17:52:18,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:52:18,179 INFO L225 Difference]: With dead ends: 42 [2024-10-11 17:52:18,179 INFO L226 Difference]: Without dead ends: 42 [2024-10-11 17:52:18,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:52:18,180 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 24 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:52:18,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 39 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:52:18,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-11 17:52:18,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 26. [2024-10-11 17:52:18,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 25 states have internal predecessors, (32), 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-11 17:52:18,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2024-10-11 17:52:18,183 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 10 [2024-10-11 17:52:18,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:52:18,183 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2024-10-11 17:52:18,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:18,183 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2024-10-11 17:52:18,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 17:52:18,184 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:52:18,184 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:52:18,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:52:18,184 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-11 17:52:18,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:52:18,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1855256335, now seen corresponding path program 1 times [2024-10-11 17:52:18,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:52:18,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699444965] [2024-10-11 17:52:18,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:52:18,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:52:18,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:52:18,296 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-11 17:52:18,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:52:18,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699444965] [2024-10-11 17:52:18,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699444965] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:52:18,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:52:18,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:52:18,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930180297] [2024-10-11 17:52:18,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:52:18,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:52:18,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:52:18,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:52:18,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:52:18,298 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:18,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:52:18,324 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2024-10-11 17:52:18,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:52:18,325 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-11 17:52:18,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:52:18,326 INFO L225 Difference]: With dead ends: 25 [2024-10-11 17:52:18,326 INFO L226 Difference]: Without dead ends: 22 [2024-10-11 17:52:18,326 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-11 17:52:18,326 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 16 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:52:18,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 30 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:52:18,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-11 17:52:18,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-11 17:52:18,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 19 states have (on average 1.368421052631579) internal successors, (26), 21 states have internal predecessors, (26), 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-11 17:52:18,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-10-11 17:52:18,328 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 11 [2024-10-11 17:52:18,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:52:18,328 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-10-11 17:52:18,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:18,329 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-10-11 17:52:18,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 17:52:18,329 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:52:18,329 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:52:18,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:52:18,333 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-11 17:52:18,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:52:18,334 INFO L85 PathProgramCache]: Analyzing trace with hash -423172507, now seen corresponding path program 1 times [2024-10-11 17:52:18,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:52:18,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693487360] [2024-10-11 17:52:18,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:52:18,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:52:18,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:52:18,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:52:18,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:52:18,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693487360] [2024-10-11 17:52:18,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693487360] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:52:18,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:52:18,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:52:18,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615021924] [2024-10-11 17:52:18,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:52:18,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:52:18,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:52:18,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:52:18,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:52:18,361 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-11 17:52:18,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:52:18,376 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2024-10-11 17:52:18,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:52:18,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2024-10-11 17:52:18,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:52:18,377 INFO L225 Difference]: With dead ends: 23 [2024-10-11 17:52:18,377 INFO L226 Difference]: Without dead ends: 23 [2024-10-11 17:52:18,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11 17:52:18,377 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:52:18,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:52:18,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-11 17:52:18,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-10-11 17:52:18,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 20 states have (on average 1.35) internal successors, (27), 22 states have internal predecessors, (27), 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-11 17:52:18,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-10-11 17:52:18,379 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 13 [2024-10-11 17:52:18,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:52:18,379 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-10-11 17:52:18,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-11 17:52:18,380 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2024-10-11 17:52:18,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 17:52:18,380 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:52:18,383 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:52:18,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:52:18,384 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-11 17:52:18,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:52:18,384 INFO L85 PathProgramCache]: Analyzing trace with hash -233596166, now seen corresponding path program 1 times [2024-10-11 17:52:18,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:52:18,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714644967] [2024-10-11 17:52:18,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:52:18,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:52:18,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:52:18,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:52:18,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:52:18,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714644967] [2024-10-11 17:52:18,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714644967] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:52:18,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:52:18,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:52:18,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144571883] [2024-10-11 17:52:18,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:52:18,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:52:18,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:52:18,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:52:18,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:52:18,524 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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-11 17:52:18,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:52:18,567 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2024-10-11 17:52:18,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 17:52:18,568 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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-11 17:52:18,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:52:18,568 INFO L225 Difference]: With dead ends: 29 [2024-10-11 17:52:18,568 INFO L226 Difference]: Without dead ends: 23 [2024-10-11 17:52:18,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:52:18,569 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 2 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:52:18,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 62 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:52:18,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-11 17:52:18,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-10-11 17:52:18,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 20 states have (on average 1.3) internal successors, (26), 22 states have internal predecessors, (26), 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-11 17:52:18,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2024-10-11 17:52:18,571 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 14 [2024-10-11 17:52:18,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:52:18,571 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2024-10-11 17:52:18,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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-11 17:52:18,571 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2024-10-11 17:52:18,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 17:52:18,571 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:52:18,571 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:52:18,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:52:18,571 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-11 17:52:18,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:52:18,572 INFO L85 PathProgramCache]: Analyzing trace with hash -820402180, now seen corresponding path program 1 times [2024-10-11 17:52:18,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:52:18,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787432125] [2024-10-11 17:52:18,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:52:18,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:52:18,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:52:18,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:52:18,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:52:18,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787432125] [2024-10-11 17:52:18,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787432125] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:52:18,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:52:18,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:52:18,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001468349] [2024-10-11 17:52:18,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:52:18,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:52:18,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:52:18,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:52:18,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:52:18,771 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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-11 17:52:18,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:52:18,855 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2024-10-11 17:52:18,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 17:52:18,855 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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-11 17:52:18,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:52:18,855 INFO L225 Difference]: With dead ends: 39 [2024-10-11 17:52:18,855 INFO L226 Difference]: Without dead ends: 39 [2024-10-11 17:52:18,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 17:52:18,856 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 14 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:52:18,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 46 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:52:18,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-11 17:52:18,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2024-10-11 17:52:18,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 36 states have internal predecessors, (42), 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-11 17:52:18,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2024-10-11 17:52:18,859 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 14 [2024-10-11 17:52:18,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:52:18,859 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2024-10-11 17:52:18,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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-11 17:52:18,859 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2024-10-11 17:52:18,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 17:52:18,862 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:52:18,862 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:52:18,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:52:18,862 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-11 17:52:18,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:52:18,863 INFO L85 PathProgramCache]: Analyzing trace with hash -562236742, now seen corresponding path program 1 times [2024-10-11 17:52:18,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:52:18,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579008333] [2024-10-11 17:52:18,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:52:18,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:52:18,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:52:19,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:52:19,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:52:19,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579008333] [2024-10-11 17:52:19,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579008333] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:52:19,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602918614] [2024-10-11 17:52:19,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:52:19,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:52:19,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:52:19,149 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:52:19,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 17:52:19,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:52:19,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 17:52:19,248 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:52:19,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 17:52:19,506 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:52:19,506 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 29 treesize of output 25 [2024-10-11 17:52:19,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:52:19,581 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:52:19,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-10-11 17:52:19,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-11 17:52:19,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2024-10-11 17:52:19,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:52:19,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602918614] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:52:19,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:52:19,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 18 [2024-10-11 17:52:19,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881707345] [2024-10-11 17:52:19,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:52:19,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 17:52:19,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:52:19,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 17:52:19,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2024-10-11 17:52:19,872 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 19 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-11 17:52:20,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:52:20,295 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2024-10-11 17:52:20,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 17:52:20,296 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 19 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 14 [2024-10-11 17:52:20,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:52:20,297 INFO L225 Difference]: With dead ends: 49 [2024-10-11 17:52:20,297 INFO L226 Difference]: Without dead ends: 49 [2024-10-11 17:52:20,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=166, Invalid=646, Unknown=0, NotChecked=0, Total=812 [2024-10-11 17:52:20,298 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 111 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:52:20,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 75 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:52:20,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-11 17:52:20,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2024-10-11 17:52:20,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 38 states have (on average 1.263157894736842) internal successors, (48), 40 states have internal predecessors, (48), 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-11 17:52:20,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2024-10-11 17:52:20,302 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 14 [2024-10-11 17:52:20,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:52:20,303 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2024-10-11 17:52:20,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 19 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-11 17:52:20,303 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2024-10-11 17:52:20,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 17:52:20,303 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:52:20,303 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:52:20,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 17:52:20,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-11 17:52:20,504 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-11 17:52:20,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:52:20,505 INFO L85 PathProgramCache]: Analyzing trace with hash 341959099, now seen corresponding path program 1 times [2024-10-11 17:52:20,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:52:20,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630655320] [2024-10-11 17:52:20,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:52:20,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:52:20,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:52:20,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:52:20,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:52:20,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630655320] [2024-10-11 17:52:20,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630655320] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:52:20,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219275444] [2024-10-11 17:52:20,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:52:20,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:52:20,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:52:20,738 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:52:20,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 17:52:20,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:52:20,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-11 17:52:20,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:52:20,825 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 14 treesize of output 10 [2024-10-11 17:52:21,041 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-11 17:52:21,041 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 19 treesize of output 16 [2024-10-11 17:52:21,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:52:21,164 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:52:21,383 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 13 treesize of output 11 [2024-10-11 17:52:21,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-10-11 17:52:21,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-11 17:52:21,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:52:21,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219275444] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:52:21,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:52:21,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 8] total 21 [2024-10-11 17:52:21,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310686402] [2024-10-11 17:52:21,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:52:21,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 17:52:21,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:52:21,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 17:52:21,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2024-10-11 17:52:21,409 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 22 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 22 states have internal predecessors, (37), 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-11 17:52:22,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:52:22,466 INFO L93 Difference]: Finished difference Result 108 states and 126 transitions. [2024-10-11 17:52:22,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 17:52:22,467 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 22 states have internal predecessors, (37), 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 15 [2024-10-11 17:52:22,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:52:22,468 INFO L225 Difference]: With dead ends: 108 [2024-10-11 17:52:22,468 INFO L226 Difference]: Without dead ends: 108 [2024-10-11 17:52:22,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=238, Invalid=952, Unknown=0, NotChecked=0, Total=1190 [2024-10-11 17:52:22,469 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 97 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 17:52:22,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 59 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 274 Invalid, 1 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 17:52:22,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-11 17:52:22,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 82. [2024-10-11 17:52:22,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 80 states have (on average 1.225) internal successors, (98), 81 states have internal predecessors, (98), 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-11 17:52:22,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 98 transitions. [2024-10-11 17:52:22,473 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 98 transitions. Word has length 15 [2024-10-11 17:52:22,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:52:22,473 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 98 transitions. [2024-10-11 17:52:22,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 22 states have internal predecessors, (37), 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-11 17:52:22,474 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 98 transitions. [2024-10-11 17:52:22,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 17:52:22,474 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:52:22,474 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:52:22,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 17:52:22,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-11 17:52:22,680 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-11 17:52:22,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:52:22,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1619773633, now seen corresponding path program 2 times [2024-10-11 17:52:22,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:52:22,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109580496] [2024-10-11 17:52:22,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:52:22,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:52:22,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:52:22,993 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:52:22,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:52:22,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109580496] [2024-10-11 17:52:22,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109580496] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:52:22,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324743399] [2024-10-11 17:52:22,995 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:52:22,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:52:22,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:52:22,997 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:52:22,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 17:52:23,066 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 17:52:23,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:52:23,068 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-11 17:52:23,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:52:23,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-10-11 17:52:23,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 17:52:23,145 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:52:23,145 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 29 treesize of output 25 [2024-10-11 17:52:23,193 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:52:23,194 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:52:23,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-11 17:52:23,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2024-10-11 17:52:23,461 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:52:23,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324743399] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:52:23,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:52:23,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-10-11 17:52:23,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412959748] [2024-10-11 17:52:23,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:52:23,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 17:52:23,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:52:23,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 17:52:23,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2024-10-11 17:52:23,464 INFO L87 Difference]: Start difference. First operand 82 states and 98 transitions. Second operand has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 19 states have internal predecessors, (35), 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-11 17:52:23,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:52:23,789 INFO L93 Difference]: Finished difference Result 111 states and 131 transitions. [2024-10-11 17:52:23,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 17:52:23,790 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 19 states have internal predecessors, (35), 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 18 [2024-10-11 17:52:23,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:52:23,790 INFO L225 Difference]: With dead ends: 111 [2024-10-11 17:52:23,791 INFO L226 Difference]: Without dead ends: 111 [2024-10-11 17:52:23,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=222, Invalid=590, Unknown=0, NotChecked=0, Total=812 [2024-10-11 17:52:23,791 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 36 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:52:23,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 66 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:52:23,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-11 17:52:23,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 66. [2024-10-11 17:52:23,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 65 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-11 17:52:23,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2024-10-11 17:52:23,795 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 18 [2024-10-11 17:52:23,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:52:23,795 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2024-10-11 17:52:23,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 19 states have internal predecessors, (35), 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-11 17:52:23,795 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2024-10-11 17:52:23,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 17:52:23,796 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:52:23,796 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:52:23,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 17:52:23,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:52:23,997 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-11 17:52:23,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:52:23,998 INFO L85 PathProgramCache]: Analyzing trace with hash 976590511, now seen corresponding path program 2 times [2024-10-11 17:52:23,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:52:23,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395309778] [2024-10-11 17:52:23,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:52:23,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:52:24,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:52:24,509 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:52:24,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:52:24,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395309778] [2024-10-11 17:52:24,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395309778] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:52:24,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748554212] [2024-10-11 17:52:24,510 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:52:24,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:52:24,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:52:24,511 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:52:24,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 17:52:24,589 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 17:52:24,589 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:52:24,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-10-11 17:52:24,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:52:24,646 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 14 treesize of output 10 [2024-10-11 17:53:20,231 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2024-10-11 17:53:20,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 31 [2024-10-11 17:53:20,317 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 19 refuted. 8 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:53:20,317 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:53:21,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2024-10-11 17:53:21,292 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 44 treesize of output 38 [2024-10-11 17:53:21,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2024-10-11 17:53:21,374 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:53:21,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748554212] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:53:21,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:53:21,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 20, 18] total 43 [2024-10-11 17:53:21,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35854520] [2024-10-11 17:53:21,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:53:21,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-10-11 17:53:21,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:53:21,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-10-11 17:53:21,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=1600, Unknown=17, NotChecked=0, Total=1892 [2024-10-11 17:53:21,380 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. Second operand has 44 states, 43 states have (on average 1.9069767441860466) internal successors, (82), 44 states have internal predecessors, (82), 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-11 17:53:28,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:53:33,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:53:38,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]