./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrcpy-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrcpy-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fa78fde783b634840a8dd117d9f71a3fa4064d7e1622444edf74e6b44f549a34 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:28:30,735 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:28:30,787 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 10:28:30,791 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:28:30,791 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:28:30,820 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:28:30,820 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:28:30,821 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:28:30,821 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:28:30,821 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:28:30,822 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:28:30,822 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:28:30,824 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:28:30,826 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:28:30,826 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:28:30,826 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:28:30,827 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:28:30,827 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:28:30,827 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:28:30,827 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:28:30,828 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:28:30,828 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:28:30,828 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 10:28:30,828 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:28:30,829 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:28:30,829 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:28:30,829 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:28:30,829 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:28:30,829 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:28:30,830 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:28:30,830 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:28:30,830 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:28:30,830 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:28:30,831 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:28:30,831 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:28:30,831 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:28:30,831 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:28:30,832 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:28:30,832 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:28:30,832 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:28:30,833 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:28:30,833 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:28:30,833 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fa78fde783b634840a8dd117d9f71a3fa4064d7e1622444edf74e6b44f549a34 [2024-10-13 10:28:31,083 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:28:31,111 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:28:31,114 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:28:31,115 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:28:31,115 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:28:31,116 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrcpy-alloca-1.i [2024-10-13 10:28:32,579 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:28:32,952 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:28:32,953 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrcpy-alloca-1.i [2024-10-13 10:28:32,972 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe3ec90a8/6aa6de8ff3234fe5a94f0014aabd6937/FLAG6a391a204 [2024-10-13 10:28:32,998 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe3ec90a8/6aa6de8ff3234fe5a94f0014aabd6937 [2024-10-13 10:28:33,005 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:28:33,006 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:28:33,013 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:28:33,013 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:28:33,022 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:28:33,026 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:28:33" (1/1) ... [2024-10-13 10:28:33,026 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a9b4136 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:28:33, skipping insertion in model container [2024-10-13 10:28:33,027 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:28:33" (1/1) ... [2024-10-13 10:28:33,100 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:28:33,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:28:33,564 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:28:33,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:28:33,689 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:28:33,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:28:33 WrapperNode [2024-10-13 10:28:33,690 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:28:33,691 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:28:33,691 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:28:33,696 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:28:33,711 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:28:33" (1/1) ... [2024-10-13 10:28:33,736 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:28:33" (1/1) ... [2024-10-13 10:28:33,771 INFO L138 Inliner]: procedures = 117, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 71 [2024-10-13 10:28:33,771 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:28:33,777 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:28:33,777 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:28:33,777 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:28:33,790 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:28:33" (1/1) ... [2024-10-13 10:28:33,792 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:28:33" (1/1) ... [2024-10-13 10:28:33,800 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:28:33" (1/1) ... [2024-10-13 10:28:33,831 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [1, 3]. 75 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 3 writes are split as follows [1, 2]. [2024-10-13 10:28:33,875 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:28:33" (1/1) ... [2024-10-13 10:28:33,876 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:28:33" (1/1) ... [2024-10-13 10:28:33,883 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:28:33" (1/1) ... [2024-10-13 10:28:33,890 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:28:33" (1/1) ... [2024-10-13 10:28:33,891 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:28:33" (1/1) ... [2024-10-13 10:28:33,892 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:28:33" (1/1) ... [2024-10-13 10:28:33,897 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:28:33,898 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:28:33,900 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:28:33,901 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:28:33,901 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:28:33" (1/1) ... [2024-10-13 10:28:33,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:28:33,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:28:33,965 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 10:28:33,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 10:28:34,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 10:28:34,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 10:28:34,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 10:28:34,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 10:28:34,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 10:28:34,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 10:28:34,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:28:34,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:28:34,099 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:28:34,100 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:28:34,212 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2024-10-13 10:28:34,212 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:28:34,236 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:28:34,237 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 10:28:34,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:28:34 BoogieIcfgContainer [2024-10-13 10:28:34,237 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:28:34,239 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:28:34,239 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:28:34,242 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:28:34,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:28:33" (1/3) ... [2024-10-13 10:28:34,243 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@697050ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:28:34, skipping insertion in model container [2024-10-13 10:28:34,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:28:33" (2/3) ... [2024-10-13 10:28:34,243 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@697050ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:28:34, skipping insertion in model container [2024-10-13 10:28:34,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:28:34" (3/3) ... [2024-10-13 10:28:34,244 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrcpy-alloca-1.i [2024-10-13 10:28:34,258 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:28:34,258 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2024-10-13 10:28:34,292 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:28:34,298 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;@24ea297f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:28:34,298 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-10-13 10:28:34,302 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 14 states have (on average 2.142857142857143) internal successors, (30), 23 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:28:34,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 10:28:34,307 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:28:34,307 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 10:28:34,308 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-13 10:28:34,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:28:34,312 INFO L85 PathProgramCache]: Analyzing trace with hash 92512218, now seen corresponding path program 1 times [2024-10-13 10:28:34,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:28:34,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703918606] [2024-10-13 10:28:34,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:28:34,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:28:34,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:28:34,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:34,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:28:34,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703918606] [2024-10-13 10:28:34,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703918606] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:28:34,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:28:34,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:28:34,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250512815] [2024-10-13 10:28:34,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:28:34,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:28:34,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:28:34,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:28:34,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:28:34,476 INFO L87 Difference]: Start difference. First operand has 24 states, 14 states have (on average 2.142857142857143) internal successors, (30), 23 states have internal predecessors, (30), 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 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:28:34,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:28:34,526 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2024-10-13 10:28:34,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:28:34,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-13 10:28:34,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:28:34,535 INFO L225 Difference]: With dead ends: 25 [2024-10-13 10:28:34,536 INFO L226 Difference]: Without dead ends: 24 [2024-10-13 10:28:34,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:28:34,542 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:28:34,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 52 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:28:34,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-13 10:28:34,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-13 10:28:34,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:28:34,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-10-13 10:28:34,572 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 5 [2024-10-13 10:28:34,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:28:34,572 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-10-13 10:28:34,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:28:34,573 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2024-10-13 10:28:34,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 10:28:34,573 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:28:34,573 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 10:28:34,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 10:28:34,574 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-13 10:28:34,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:28:34,575 INFO L85 PathProgramCache]: Analyzing trace with hash 92514140, now seen corresponding path program 1 times [2024-10-13 10:28:34,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:28:34,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914144153] [2024-10-13 10:28:34,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:28:34,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:28:34,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:28:34,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:34,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:28:34,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914144153] [2024-10-13 10:28:34,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914144153] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:28:34,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:28:34,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 10:28:34,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292968350] [2024-10-13 10:28:34,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:28:34,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:28:34,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:28:34,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:28:34,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:28:34,624 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:28:34,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:28:34,648 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2024-10-13 10:28:34,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:28:34,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-13 10:28:34,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:28:34,650 INFO L225 Difference]: With dead ends: 25 [2024-10-13 10:28:34,650 INFO L226 Difference]: Without dead ends: 24 [2024-10-13 10:28:34,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:28:34,651 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 32 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-13 10:28:34,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 32 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:28:34,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-13 10:28:34,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2024-10-13 10:28:34,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 14 states have (on average 1.8571428571428572) 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-13 10:28:34,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2024-10-13 10:28:34,657 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 5 [2024-10-13 10:28:34,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:28:34,657 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2024-10-13 10:28:34,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:28:34,658 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2024-10-13 10:28:34,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 10:28:34,658 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:28:34,658 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 10:28:34,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 10:28:34,658 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-13 10:28:34,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:28:34,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1427087765, now seen corresponding path program 1 times [2024-10-13 10:28:34,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:28:34,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422268881] [2024-10-13 10:28:34,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:28:34,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:28:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:28:34,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:34,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:28:34,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422268881] [2024-10-13 10:28:34,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422268881] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:28:34,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:28:34,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:28:34,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109366034] [2024-10-13 10:28:34,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:28:34,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:28:34,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:28:34,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:28:34,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:28:34,772 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 4 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-13 10:28:34,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:28:34,804 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2024-10-13 10:28:34,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:28:34,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 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-13 10:28:34,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:28:34,805 INFO L225 Difference]: With dead ends: 28 [2024-10-13 10:28:34,805 INFO L226 Difference]: Without dead ends: 28 [2024-10-13 10:28:34,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-13 10:28:34,806 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 3 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:28:34,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 49 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:28:34,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-13 10:28:34,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2024-10-13 10:28:34,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.75) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:28:34,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2024-10-13 10:28:34,809 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 6 [2024-10-13 10:28:34,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:28:34,810 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2024-10-13 10:28:34,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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-13 10:28:34,810 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2024-10-13 10:28:34,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 10:28:34,810 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:28:34,810 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 10:28:34,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 10:28:34,811 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-13 10:28:34,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:28:34,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1427028183, now seen corresponding path program 1 times [2024-10-13 10:28:34,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:28:34,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226955674] [2024-10-13 10:28:34,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:28:34,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:28:34,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:28:34,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:34,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:28:34,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226955674] [2024-10-13 10:28:34,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226955674] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:28:34,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:28:34,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:28:34,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186462471] [2024-10-13 10:28:34,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:28:34,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:28:34,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:28:34,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:28:34,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:28:34,885 INFO L87 Difference]: Start difference. First operand 25 states and 28 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-13 10:28:34,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:28:34,906 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2024-10-13 10:28:34,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:28:34,906 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-13 10:28:34,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:28:34,907 INFO L225 Difference]: With dead ends: 23 [2024-10-13 10:28:34,907 INFO L226 Difference]: Without dead ends: 23 [2024-10-13 10:28:34,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:28:34,908 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 3 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:28:34,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 27 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:28:34,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-13 10:28:34,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-10-13 10:28:34,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.625) 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-13 10:28:34,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2024-10-13 10:28:34,911 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 6 [2024-10-13 10:28:34,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:28:34,911 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2024-10-13 10:28:34,911 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-13 10:28:34,911 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2024-10-13 10:28:34,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 10:28:34,912 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:28:34,912 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 10:28:34,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 10:28:34,912 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-13 10:28:34,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:28:34,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1427028182, now seen corresponding path program 1 times [2024-10-13 10:28:34,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:28:34,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204461107] [2024-10-13 10:28:34,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:28:34,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:28:34,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:28:34,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:34,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:28:34,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204461107] [2024-10-13 10:28:34,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204461107] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:28:34,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:28:34,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:28:34,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687989570] [2024-10-13 10:28:34,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:28:34,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:28:34,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:28:34,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:28:34,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:28:34,975 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 4 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-13 10:28:35,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:28:35,010 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2024-10-13 10:28:35,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:28:35,011 INFO L78 Accepts]: Start accepts. Automaton has has 4 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-13 10:28:35,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:28:35,012 INFO L225 Difference]: With dead ends: 28 [2024-10-13 10:28:35,014 INFO L226 Difference]: Without dead ends: 28 [2024-10-13 10:28:35,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:28:35,018 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:28:35,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 46 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:28:35,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-13 10:28:35,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2024-10-13 10:28:35,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:28:35,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-10-13 10:28:35,026 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 6 [2024-10-13 10:28:35,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:28:35,027 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-10-13 10:28:35,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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-13 10:28:35,027 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2024-10-13 10:28:35,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 10:28:35,027 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:28:35,027 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 10:28:35,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 10:28:35,028 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-13 10:28:35,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:28:35,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1425181140, now seen corresponding path program 1 times [2024-10-13 10:28:35,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:28:35,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148502567] [2024-10-13 10:28:35,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:28:35,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:28:35,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:28:35,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:35,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:28:35,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148502567] [2024-10-13 10:28:35,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148502567] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:28:35,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:28:35,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:28:35,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842217800] [2024-10-13 10:28:35,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:28:35,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:28:35,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:28:35,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:28:35,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:28:35,184 INFO L87 Difference]: Start difference. First operand 24 states and 28 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-13 10:28:35,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:28:35,231 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2024-10-13 10:28:35,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:28:35,232 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-13 10:28:35,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:28:35,232 INFO L225 Difference]: With dead ends: 26 [2024-10-13 10:28:35,233 INFO L226 Difference]: Without dead ends: 26 [2024-10-13 10:28:35,236 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-13 10:28:35,237 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 9 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:28:35,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 28 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:28:35,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-13 10:28:35,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-10-13 10:28:35,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.631578947368421) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:28:35,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2024-10-13 10:28:35,244 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 6 [2024-10-13 10:28:35,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:28:35,244 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2024-10-13 10:28:35,244 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-13 10:28:35,244 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2024-10-13 10:28:35,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-13 10:28:35,244 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:28:35,245 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:28:35,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 10:28:35,245 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-13 10:28:35,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:28:35,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1290049389, now seen corresponding path program 1 times [2024-10-13 10:28:35,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:28:35,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857539755] [2024-10-13 10:28:35,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:28:35,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:28:35,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:28:35,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:35,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:28:35,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857539755] [2024-10-13 10:28:35,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857539755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:28:35,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:28:35,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:28:35,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963006676] [2024-10-13 10:28:35,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:28:35,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:28:35,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:28:35,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:28:35,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:28:35,419 INFO L87 Difference]: Start difference. First operand 26 states and 31 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-13 10:28:35,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:28:35,450 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2024-10-13 10:28:35,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:28:35,451 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-13 10:28:35,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:28:35,451 INFO L225 Difference]: With dead ends: 30 [2024-10-13 10:28:35,451 INFO L226 Difference]: Without dead ends: 30 [2024-10-13 10:28:35,451 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-13 10:28:35,452 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 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-13 10:28:35,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:28:35,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-13 10:28:35,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-13 10:28:35,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.5217391304347827) 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-13 10:28:35,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2024-10-13 10:28:35,458 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 7 [2024-10-13 10:28:35,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:28:35,459 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-10-13 10:28:35,459 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-13 10:28:35,459 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2024-10-13 10:28:35,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-13 10:28:35,459 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:28:35,459 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:28:35,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 10:28:35,459 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-13 10:28:35,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:28:35,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1288202347, now seen corresponding path program 1 times [2024-10-13 10:28:35,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:28:35,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202718955] [2024-10-13 10:28:35,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:28:35,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:28:35,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:28:35,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:35,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:28:35,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202718955] [2024-10-13 10:28:35,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202718955] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:28:35,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:28:35,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:28:35,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636065895] [2024-10-13 10:28:35,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:28:35,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:28:35,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:28:35,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:28:35,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:28:35,600 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 5 states, 4 states have (on average 1.75) 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-13 10:28:35,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:28:35,619 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2024-10-13 10:28:35,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:28:35,620 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) 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-13 10:28:35,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:28:35,621 INFO L225 Difference]: With dead ends: 29 [2024-10-13 10:28:35,621 INFO L226 Difference]: Without dead ends: 29 [2024-10-13 10:28:35,622 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-13 10:28:35,622 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 9 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:28:35,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 25 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:28:35,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-13 10:28:35,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2024-10-13 10:28:35,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 24 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:28:35,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2024-10-13 10:28:35,627 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 7 [2024-10-13 10:28:35,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:28:35,627 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2024-10-13 10:28:35,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) 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-13 10:28:35,627 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2024-10-13 10:28:35,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-13 10:28:35,629 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:28:35,629 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-10-13 10:28:35,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 10:28:35,629 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-13 10:28:35,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:28:35,630 INFO L85 PathProgramCache]: Analyzing trace with hash 495533113, now seen corresponding path program 1 times [2024-10-13 10:28:35,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:28:35,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152098944] [2024-10-13 10:28:35,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:28:35,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:28:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:28:35,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:35,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:28:35,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152098944] [2024-10-13 10:28:35,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152098944] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:28:35,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021526334] [2024-10-13 10:28:35,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:28:35,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:28:35,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:28:35,820 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:28:35,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 10:28:35,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:28:35,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-13 10:28:35,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:28:35,937 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 7 [2024-10-13 10:28:35,944 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 8 treesize of output 1 [2024-10-13 10:28:36,079 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:36,080 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:28:36,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:36,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021526334] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:28:36,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:28:36,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2024-10-13 10:28:36,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723880678] [2024-10-13 10:28:36,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:28:36,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 10:28:36,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:28:36,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 10:28:36,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-10-13 10:28:36,236 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:28:36,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:28:36,394 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2024-10-13 10:28:36,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 10:28:36,395 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 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 8 [2024-10-13 10:28:36,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:28:36,395 INFO L225 Difference]: With dead ends: 25 [2024-10-13 10:28:36,395 INFO L226 Difference]: Without dead ends: 25 [2024-10-13 10:28:36,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2024-10-13 10:28:36,396 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:28:36,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 73 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:28:36,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-13 10:28:36,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2024-10-13 10:28:36,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.5294117647058822) 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-13 10:28:36,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-10-13 10:28:36,399 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 8 [2024-10-13 10:28:36,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:28:36,399 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-10-13 10:28:36,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:28:36,399 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-10-13 10:28:36,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-13 10:28:36,400 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:28:36,400 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:28:36,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 10:28:36,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:28:36,601 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-13 10:28:36,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:28:36,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1508116980, now seen corresponding path program 1 times [2024-10-13 10:28:36,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:28:36,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726627508] [2024-10-13 10:28:36,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:28:36,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:28:36,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:28:36,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:36,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:28:36,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726627508] [2024-10-13 10:28:36,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726627508] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:28:36,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:28:36,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:28:36,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346649440] [2024-10-13 10:28:36,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:28:36,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:28:36,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:28:36,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:28:36,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:28:36,671 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:28:36,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:28:36,710 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2024-10-13 10:28:36,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:28:36,711 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2024-10-13 10:28:36,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:28:36,711 INFO L225 Difference]: With dead ends: 21 [2024-10-13 10:28:36,711 INFO L226 Difference]: Without dead ends: 21 [2024-10-13 10:28:36,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:28:36,712 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 7 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:28:36,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 27 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:28:36,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-13 10:28:36,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-10-13 10:28:36,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:28:36,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2024-10-13 10:28:36,717 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 9 [2024-10-13 10:28:36,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:28:36,718 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2024-10-13 10:28:36,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:28:36,718 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2024-10-13 10:28:36,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-13 10:28:36,718 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:28:36,718 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:28:36,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 10:28:36,718 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-13 10:28:36,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:28:36,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1508116981, now seen corresponding path program 1 times [2024-10-13 10:28:36,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:28:36,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978977686] [2024-10-13 10:28:36,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:28:36,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:28:36,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:28:36,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:36,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:28:36,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978977686] [2024-10-13 10:28:36,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978977686] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:28:36,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:28:36,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:28:36,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049689426] [2024-10-13 10:28:36,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:28:36,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:28:36,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:28:36,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:28:36,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:28:36,854 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:28:36,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:28:36,882 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2024-10-13 10:28:36,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:28:36,882 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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 9 [2024-10-13 10:28:36,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:28:36,883 INFO L225 Difference]: With dead ends: 23 [2024-10-13 10:28:36,883 INFO L226 Difference]: Without dead ends: 23 [2024-10-13 10:28:36,883 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-13 10:28:36,884 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 4 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:28:36,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 37 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:28:36,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-13 10:28:36,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-10-13 10:28:36,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.4210526315789473) 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-13 10:28:36,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-10-13 10:28:36,886 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 9 [2024-10-13 10:28:36,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:28:36,886 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-10-13 10:28:36,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:28:36,886 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2024-10-13 10:28:36,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 10:28:36,887 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:28:36,887 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:28:36,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 10:28:36,887 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-13 10:28:36,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:28:36,888 INFO L85 PathProgramCache]: Analyzing trace with hash -493013856, now seen corresponding path program 1 times [2024-10-13 10:28:36,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:28:36,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514107476] [2024-10-13 10:28:36,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:28:36,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:28:36,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:28:36,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:36,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:28:36,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514107476] [2024-10-13 10:28:36,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514107476] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:28:36,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:28:36,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:28:36,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089823951] [2024-10-13 10:28:36,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:28:36,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:28:36,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:28:36,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:28:36,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:28:36,981 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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-13 10:28:37,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:28:37,024 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2024-10-13 10:28:37,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:28:37,025 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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-13 10:28:37,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:28:37,025 INFO L225 Difference]: With dead ends: 22 [2024-10-13 10:28:37,025 INFO L226 Difference]: Without dead ends: 22 [2024-10-13 10:28:37,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:28:37,026 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 9 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:28:37,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 33 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:28:37,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-13 10:28:37,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-13 10:28:37,028 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-13 10:28:37,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-10-13 10:28:37,028 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 10 [2024-10-13 10:28:37,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:28:37,028 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-10-13 10:28:37,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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-13 10:28:37,029 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-10-13 10:28:37,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 10:28:37,029 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:28:37,029 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:28:37,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 10:28:37,029 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-13 10:28:37,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:28:37,030 INFO L85 PathProgramCache]: Analyzing trace with hash -493013855, now seen corresponding path program 1 times [2024-10-13 10:28:37,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:28:37,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30183856] [2024-10-13 10:28:37,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:28:37,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:28:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:28:37,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:37,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:28:37,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30183856] [2024-10-13 10:28:37,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30183856] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:28:37,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:28:37,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:28:37,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621089787] [2024-10-13 10:28:37,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:28:37,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:28:37,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:28:37,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:28:37,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:28:37,164 INFO L87 Difference]: Start difference. First operand 22 states and 26 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-13 10:28:37,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:28:37,214 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2024-10-13 10:28:37,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:28:37,214 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-13 10:28:37,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:28:37,215 INFO L225 Difference]: With dead ends: 29 [2024-10-13 10:28:37,215 INFO L226 Difference]: Without dead ends: 29 [2024-10-13 10:28:37,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:28:37,215 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:28:37,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 50 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:28:37,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-13 10:28:37,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-13 10:28:37,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 28 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-13 10:28:37,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2024-10-13 10:28:37,221 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 10 [2024-10-13 10:28:37,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:28:37,222 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2024-10-13 10:28:37,222 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-13 10:28:37,222 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2024-10-13 10:28:37,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 10:28:37,222 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:28:37,222 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:28:37,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 10:28:37,222 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-13 10:28:37,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:28:37,223 INFO L85 PathProgramCache]: Analyzing trace with hash 187044515, now seen corresponding path program 1 times [2024-10-13 10:28:37,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:28:37,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264077237] [2024-10-13 10:28:37,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:28:37,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:28:37,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:28:37,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:37,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:28:37,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264077237] [2024-10-13 10:28:37,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264077237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:28:37,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:28:37,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:28:37,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729545655] [2024-10-13 10:28:37,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:28:37,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:28:37,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:28:37,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:28:37,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:28:37,393 INFO L87 Difference]: Start difference. First operand 29 states and 33 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-13 10:28:37,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:28:37,424 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2024-10-13 10:28:37,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:28:37,424 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-13 10:28:37,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:28:37,425 INFO L225 Difference]: With dead ends: 30 [2024-10-13 10:28:37,425 INFO L226 Difference]: Without dead ends: 30 [2024-10-13 10:28:37,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:28:37,425 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 4 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:28:37,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 37 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:28:37,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-13 10:28:37,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 23. [2024-10-13 10:28:37,427 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-13 10:28:37,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-10-13 10:28:37,427 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 10 [2024-10-13 10:28:37,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:28:37,427 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-10-13 10:28:37,427 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-13 10:28:37,428 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2024-10-13 10:28:37,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-13 10:28:37,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:28:37,428 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:28:37,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 10:28:37,428 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-13 10:28:37,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:28:37,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1412393616, now seen corresponding path program 1 times [2024-10-13 10:28:37,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:28:37,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786142305] [2024-10-13 10:28:37,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:28:37,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:28:37,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:28:37,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:37,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:28:37,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786142305] [2024-10-13 10:28:37,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786142305] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:28:37,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:28:37,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:28:37,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026754440] [2024-10-13 10:28:37,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:28:37,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:28:37,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:28:37,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:28:37,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:28:37,490 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 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-13 10:28:37,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:28:37,502 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2024-10-13 10:28:37,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:28:37,503 INFO L78 Accepts]: Start accepts. Automaton has has 4 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-13 10:28:37,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:28:37,503 INFO L225 Difference]: With dead ends: 22 [2024-10-13 10:28:37,503 INFO L226 Difference]: Without dead ends: 20 [2024-10-13 10:28:37,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:28:37,504 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 7 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:28:37,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 24 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:28:37,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-13 10:28:37,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-13 10:28:37,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:28:37,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-10-13 10:28:37,507 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 13 [2024-10-13 10:28:37,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:28:37,507 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-10-13 10:28:37,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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-13 10:28:37,507 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-10-13 10:28:37,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-13 10:28:37,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:28:37,508 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:28:37,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 10:28:37,509 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-13 10:28:37,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:28:37,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1412394685, now seen corresponding path program 1 times [2024-10-13 10:28:37,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:28:37,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248153203] [2024-10-13 10:28:37,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:28:37,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:28:37,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:28:37,594 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:37,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:28:37,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248153203] [2024-10-13 10:28:37,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248153203] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:28:37,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:28:37,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 10:28:37,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077002698] [2024-10-13 10:28:37,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:28:37,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:28:37,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:28:37,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:28:37,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:28:37,596 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 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-13 10:28:37,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:28:37,621 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2024-10-13 10:28:37,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:28:37,621 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 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-13 10:28:37,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:28:37,621 INFO L225 Difference]: With dead ends: 28 [2024-10-13 10:28:37,621 INFO L226 Difference]: Without dead ends: 20 [2024-10-13 10:28:37,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:28:37,622 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:28:37,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:28:37,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-13 10:28:37,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-13 10:28:37,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:28:37,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2024-10-13 10:28:37,624 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 13 [2024-10-13 10:28:37,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:28:37,624 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2024-10-13 10:28:37,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 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-13 10:28:37,624 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2024-10-13 10:28:37,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-13 10:28:37,624 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:28:37,624 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:28:37,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 10:28:37,624 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-13 10:28:37,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:28:37,625 INFO L85 PathProgramCache]: Analyzing trace with hash 2113459263, now seen corresponding path program 1 times [2024-10-13 10:28:37,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:28:37,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347017145] [2024-10-13 10:28:37,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:28:37,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:28:37,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:28:37,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:37,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:28:37,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347017145] [2024-10-13 10:28:37,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347017145] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:28:37,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:28:37,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 10:28:37,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676888243] [2024-10-13 10:28:37,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:28:37,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:28:37,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:28:37,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:28:37,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:28:37,738 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 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-13 10:28:37,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:28:37,765 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2024-10-13 10:28:37,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:28:37,766 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 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-13 10:28:37,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:28:37,766 INFO L225 Difference]: With dead ends: 26 [2024-10-13 10:28:37,766 INFO L226 Difference]: Without dead ends: 17 [2024-10-13 10:28:37,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:28:37,766 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:28:37,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:28:37,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-10-13 10:28:37,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-10-13 10:28:37,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:28:37,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2024-10-13 10:28:37,768 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 13 [2024-10-13 10:28:37,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:28:37,768 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2024-10-13 10:28:37,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 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-13 10:28:37,768 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2024-10-13 10:28:37,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-13 10:28:37,768 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:28:37,768 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:28:37,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 10:28:37,768 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-13 10:28:37,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:28:37,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1923342595, now seen corresponding path program 1 times [2024-10-13 10:28:37,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:28:37,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152353077] [2024-10-13 10:28:37,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:28:37,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:28:37,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:28:37,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:37,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:28:37,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152353077] [2024-10-13 10:28:37,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152353077] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:28:37,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:28:37,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 10:28:37,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176858919] [2024-10-13 10:28:37,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:28:37,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:28:37,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:28:37,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:28:37,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:28:37,896 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 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-13 10:28:37,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:28:37,927 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2024-10-13 10:28:37,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:28:37,928 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 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-13 10:28:37,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:28:37,928 INFO L225 Difference]: With dead ends: 25 [2024-10-13 10:28:37,928 INFO L226 Difference]: Without dead ends: 19 [2024-10-13 10:28:37,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:28:37,929 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 1 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:28:37,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 34 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:28:37,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-10-13 10:28:37,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2024-10-13 10:28:37,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:28:37,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2024-10-13 10:28:37,930 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2024-10-13 10:28:37,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:28:37,930 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2024-10-13 10:28:37,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 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-13 10:28:37,930 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2024-10-13 10:28:37,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-13 10:28:37,930 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:28:37,930 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:28:37,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 10:28:37,931 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-13 10:28:37,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:28:37,931 INFO L85 PathProgramCache]: Analyzing trace with hash -643506096, now seen corresponding path program 1 times [2024-10-13 10:28:37,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:28:37,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290640741] [2024-10-13 10:28:37,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:28:37,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:28:37,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:28:38,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:38,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:28:38,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290640741] [2024-10-13 10:28:38,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290640741] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:28:38,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338504628] [2024-10-13 10:28:38,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:28:38,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:28:38,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:28:38,102 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:28:38,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 10:28:38,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:28:38,164 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-13 10:28:38,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:28:38,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:38,228 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:28:38,312 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-13 10:28:38,333 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:38,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338504628] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:28:38,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:28:38,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2024-10-13 10:28:38,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878138474] [2024-10-13 10:28:38,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:28:38,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-13 10:28:38,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:28:38,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-13 10:28:38,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2024-10-13 10:28:38,336 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 17 states, 16 states have (on average 1.875) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:28:38,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:28:38,414 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2024-10-13 10:28:38,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:28:38,414 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.875) internal successors, (30), 17 states have internal predecessors, (30), 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-13 10:28:38,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:28:38,415 INFO L225 Difference]: With dead ends: 22 [2024-10-13 10:28:38,415 INFO L226 Difference]: Without dead ends: 22 [2024-10-13 10:28:38,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2024-10-13 10:28:38,416 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 3 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:28:38,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 34 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:28:38,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-13 10:28:38,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2024-10-13 10:28:38,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:28:38,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-10-13 10:28:38,417 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 15 [2024-10-13 10:28:38,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:28:38,418 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-10-13 10:28:38,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.875) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:28:38,418 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2024-10-13 10:28:38,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-13 10:28:38,418 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:28:38,418 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:28:38,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 10:28:38,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:28:38,623 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-13 10:28:38,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:28:38,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1526147494, now seen corresponding path program 1 times [2024-10-13 10:28:38,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:28:38,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100993871] [2024-10-13 10:28:38,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:28:38,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:28:38,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:28:38,936 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:38,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:28:38,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100993871] [2024-10-13 10:28:38,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100993871] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:28:38,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826713971] [2024-10-13 10:28:38,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:28:38,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:28:38,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:28:38,940 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:28:38,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 10:28:39,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:28:39,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-13 10:28:39,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:28:39,050 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-13 10:28:39,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:28:39,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-13 10:28:39,203 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:39,203 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:28:39,375 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:28:39,405 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:39,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826713971] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:28:39,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:28:39,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 22 [2024-10-13 10:28:39,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483715695] [2024-10-13 10:28:39,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:28:39,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-13 10:28:39,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:28:39,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-13 10:28:39,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2024-10-13 10:28:39,407 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 24 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 23 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-13 10:28:39,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:28:39,624 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2024-10-13 10:28:39,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 10:28:39,624 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 23 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) Word has length 16 [2024-10-13 10:28:39,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:28:39,625 INFO L225 Difference]: With dead ends: 23 [2024-10-13 10:28:39,625 INFO L226 Difference]: Without dead ends: 23 [2024-10-13 10:28:39,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=759, Unknown=0, NotChecked=0, Total=870 [2024-10-13 10:28:39,626 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 8 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:28:39,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 46 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:28:39,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-13 10:28:39,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2024-10-13 10:28:39,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:28:39,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2024-10-13 10:28:39,627 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 16 [2024-10-13 10:28:39,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:28:39,627 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2024-10-13 10:28:39,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 23 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-13 10:28:39,627 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2024-10-13 10:28:39,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 10:28:39,627 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:28:39,627 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:28:39,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-13 10:28:39,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:28:39,832 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-13 10:28:39,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:28:39,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1063805032, now seen corresponding path program 2 times [2024-10-13 10:28:39,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:28:39,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929748942] [2024-10-13 10:28:39,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:28:39,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:28:39,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:28:40,051 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:40,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:28:40,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929748942] [2024-10-13 10:28:40,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929748942] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:28:40,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866520782] [2024-10-13 10:28:40,053 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:28:40,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:28:40,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:28:40,055 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:28:40,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 10:28:40,124 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:28:40,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:28:40,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-13 10:28:40,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:28:40,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-13 10:28:40,199 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:40,199 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:28:40,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-10-13 10:28:40,221 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 16 treesize of output 12 [2024-10-13 10:28:40,258 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:40,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866520782] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:28:40,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:28:40,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 18 [2024-10-13 10:28:40,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102427006] [2024-10-13 10:28:40,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:28:40,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-13 10:28:40,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:28:40,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-13 10:28:40,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2024-10-13 10:28:40,261 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:28:40,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:28:40,400 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2024-10-13 10:28:40,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 10:28:40,400 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 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 19 [2024-10-13 10:28:40,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:28:40,401 INFO L225 Difference]: With dead ends: 35 [2024-10-13 10:28:40,401 INFO L226 Difference]: Without dead ends: 25 [2024-10-13 10:28:40,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2024-10-13 10:28:40,402 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 2 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:28:40,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 71 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:28:40,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-13 10:28:40,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2024-10-13 10:28:40,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:28:40,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2024-10-13 10:28:40,407 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 19 [2024-10-13 10:28:40,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:28:40,407 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2024-10-13 10:28:40,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:28:40,408 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2024-10-13 10:28:40,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-13 10:28:40,408 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:28:40,408 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:28:40,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-13 10:28:40,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:28:40,609 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-13 10:28:40,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:28:40,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1882248875, now seen corresponding path program 3 times [2024-10-13 10:28:40,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:28:40,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346955721] [2024-10-13 10:28:40,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:28:40,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:28:40,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:28:40,842 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:40,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:28:40,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346955721] [2024-10-13 10:28:40,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346955721] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:28:40,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559638209] [2024-10-13 10:28:40,843 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 10:28:40,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:28:40,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:28:40,846 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:28:40,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-13 10:28:40,912 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-13 10:28:40,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:28:40,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-13 10:28:40,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:28:41,004 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:41,005 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:28:41,087 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-13 10:28:41,152 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:41,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559638209] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:28:41,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:28:41,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2024-10-13 10:28:41,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203885682] [2024-10-13 10:28:41,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:28:41,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-13 10:28:41,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:28:41,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-13 10:28:41,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2024-10-13 10:28:41,153 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 21 states, 20 states have (on average 2.45) internal successors, (49), 21 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:28:41,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:28:41,284 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2024-10-13 10:28:41,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 10:28:41,285 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.45) internal successors, (49), 21 states have internal predecessors, (49), 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 21 [2024-10-13 10:28:41,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:28:41,285 INFO L225 Difference]: With dead ends: 27 [2024-10-13 10:28:41,285 INFO L226 Difference]: Without dead ends: 27 [2024-10-13 10:28:41,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2024-10-13 10:28:41,286 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 2 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:28:41,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 56 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:28:41,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-13 10:28:41,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-13 10:28:41,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:28:41,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2024-10-13 10:28:41,287 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 21 [2024-10-13 10:28:41,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:28:41,288 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2024-10-13 10:28:41,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.45) internal successors, (49), 21 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:28:41,288 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2024-10-13 10:28:41,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-13 10:28:41,288 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:28:41,288 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:28:41,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-13 10:28:41,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-13 10:28:41,493 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-13 10:28:41,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:28:41,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1779827029, now seen corresponding path program 2 times [2024-10-13 10:28:41,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:28:41,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516252757] [2024-10-13 10:28:41,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:28:41,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:28:41,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:28:41,883 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:41,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:28:41,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516252757] [2024-10-13 10:28:41,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516252757] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:28:41,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852811024] [2024-10-13 10:28:41,884 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:28:41,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:28:41,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:28:41,885 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:28:41,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-13 10:28:41,955 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:28:41,955 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:28:41,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-10-13 10:28:41,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:28:42,025 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-13 10:28:42,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:28:42,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-13 10:28:42,690 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:42,690 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:28:43,024 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:28:43,059 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:43,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852811024] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:28:43,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:28:43,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 34 [2024-10-13 10:28:43,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191551962] [2024-10-13 10:28:43,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:28:43,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-10-13 10:28:43,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:28:43,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-10-13 10:28:43,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1104, Unknown=0, NotChecked=0, Total=1260 [2024-10-13 10:28:43,062 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 36 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 35 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:28:43,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:28:43,402 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2024-10-13 10:28:43,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-13 10:28:43,403 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 35 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-10-13 10:28:43,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:28:43,403 INFO L225 Difference]: With dead ends: 31 [2024-10-13 10:28:43,403 INFO L226 Difference]: Without dead ends: 31 [2024-10-13 10:28:43,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=197, Invalid=1363, Unknown=0, NotChecked=0, Total=1560 [2024-10-13 10:28:43,404 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 8 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:28:43,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 58 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:28:43,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-13 10:28:43,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2024-10-13 10:28:43,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:28:43,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2024-10-13 10:28:43,406 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 22 [2024-10-13 10:28:43,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:28:43,406 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2024-10-13 10:28:43,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 35 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:28:43,406 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2024-10-13 10:28:43,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-13 10:28:43,407 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:28:43,407 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:28:43,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-13 10:28:43,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:28:43,607 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-13 10:28:43,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:28:43,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1455755149, now seen corresponding path program 4 times [2024-10-13 10:28:43,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:28:43,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068502763] [2024-10-13 10:28:43,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:28:43,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:28:43,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:28:43,806 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:43,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:28:43,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068502763] [2024-10-13 10:28:43,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068502763] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:28:43,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821798115] [2024-10-13 10:28:43,806 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 10:28:43,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:28:43,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:28:43,808 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:28:43,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-13 10:28:43,872 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 10:28:43,873 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:28:43,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-13 10:28:43,875 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:28:43,897 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-13 10:28:44,417 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-10-13 10:28:44,417 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 40 treesize of output 39 [2024-10-13 10:28:44,543 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 10:28:44,543 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:28:44,994 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-13 10:28:45,007 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 64 treesize of output 54 [2024-10-13 10:28:45,013 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-13 10:28:45,028 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 10:28:45,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821798115] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:28:45,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:28:45,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 36 [2024-10-13 10:28:45,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352284709] [2024-10-13 10:28:45,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:28:45,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-10-13 10:28:45,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:28:45,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-10-13 10:28:45,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1112, Unknown=0, NotChecked=0, Total=1260 [2024-10-13 10:28:45,030 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 36 states, 36 states have (on average 1.6944444444444444) internal successors, (61), 36 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:28:45,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:28:45,793 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2024-10-13 10:28:45,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-13 10:28:45,794 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.6944444444444444) internal successors, (61), 36 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-10-13 10:28:45,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:28:45,794 INFO L225 Difference]: With dead ends: 44 [2024-10-13 10:28:45,794 INFO L226 Difference]: Without dead ends: 30 [2024-10-13 10:28:45,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=312, Invalid=2237, Unknown=1, NotChecked=0, Total=2550 [2024-10-13 10:28:45,795 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 10 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:28:45,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 48 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:28:45,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-13 10:28:45,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2024-10-13 10:28:45,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:28:45,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2024-10-13 10:28:45,797 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 25 [2024-10-13 10:28:45,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:28:45,797 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2024-10-13 10:28:45,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.6944444444444444) internal successors, (61), 36 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:28:45,798 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2024-10-13 10:28:45,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-13 10:28:45,799 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:28:45,800 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:28:45,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-13 10:28:46,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:28:46,001 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-13 10:28:46,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:28:46,001 INFO L85 PathProgramCache]: Analyzing trace with hash -691774608, now seen corresponding path program 3 times [2024-10-13 10:28:46,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:28:46,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132382339] [2024-10-13 10:28:46,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:28:46,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:28:46,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:28:46,429 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:46,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:28:46,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132382339] [2024-10-13 10:28:46,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132382339] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:28:46,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557908833] [2024-10-13 10:28:46,430 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 10:28:46,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:28:46,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:28:46,432 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:28:46,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-13 10:28:46,504 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-10-13 10:28:46,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:28:46,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 96 conjuncts are in the unsatisfiable core [2024-10-13 10:28:46,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:28:46,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-13 10:28:46,539 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-13 10:28:46,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-13 10:28:47,130 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:47,131 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:28:47,504 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:28:47,535 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:47,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557908833] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:28:47,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:28:47,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2024-10-13 10:28:47,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997741266] [2024-10-13 10:28:47,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:28:47,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-13 10:28:47,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:28:47,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-13 10:28:47,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1477, Unknown=0, NotChecked=0, Total=1640 [2024-10-13 10:28:47,538 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 41 states, 40 states have (on average 2.1) internal successors, (84), 40 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:28:48,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:28:48,015 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2024-10-13 10:28:48,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-13 10:28:48,016 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.1) internal successors, (84), 40 states have internal predecessors, (84), 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 28 [2024-10-13 10:28:48,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:28:48,016 INFO L225 Difference]: With dead ends: 36 [2024-10-13 10:28:48,016 INFO L226 Difference]: Without dead ends: 36 [2024-10-13 10:28:48,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=232, Invalid=2024, Unknown=0, NotChecked=0, Total=2256 [2024-10-13 10:28:48,018 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 10 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:28:48,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 82 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:28:48,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-13 10:28:48,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2024-10-13 10:28:48,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:28:48,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2024-10-13 10:28:48,019 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 28 [2024-10-13 10:28:48,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:28:48,019 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2024-10-13 10:28:48,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.1) internal successors, (84), 40 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:28:48,020 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2024-10-13 10:28:48,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-13 10:28:48,024 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:28:48,024 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:28:48,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-13 10:28:48,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-10-13 10:28:48,225 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-13 10:28:48,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:28:48,226 INFO L85 PathProgramCache]: Analyzing trace with hash -582512600, now seen corresponding path program 4 times [2024-10-13 10:28:48,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:28:48,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470937291] [2024-10-13 10:28:48,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:28:48,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:28:48,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:28:48,626 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:48,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:28:48,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470937291] [2024-10-13 10:28:48,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470937291] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:28:48,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629507344] [2024-10-13 10:28:48,626 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 10:28:48,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:28:48,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:28:48,628 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:28:48,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-13 10:28:48,713 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 10:28:48,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:28:48,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-10-13 10:28:48,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:28:48,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-13 10:28:48,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-13 10:28:48,918 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:48,918 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:28:48,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-10-13 10:28:48,958 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 16 treesize of output 12 [2024-10-13 10:28:49,013 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:49,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629507344] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:28:49,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:28:49,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 30 [2024-10-13 10:28:49,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334070012] [2024-10-13 10:28:49,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:28:49,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-13 10:28:49,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:28:49,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-13 10:28:49,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=794, Unknown=0, NotChecked=0, Total=870 [2024-10-13 10:28:49,015 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 30 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 30 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:28:49,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:28:49,448 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2024-10-13 10:28:49,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 10:28:49,449 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 30 states have internal predecessors, (65), 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 32 [2024-10-13 10:28:49,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:28:49,449 INFO L225 Difference]: With dead ends: 54 [2024-10-13 10:28:49,449 INFO L226 Difference]: Without dead ends: 36 [2024-10-13 10:28:49,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=170, Invalid=1722, Unknown=0, NotChecked=0, Total=1892 [2024-10-13 10:28:49,450 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 3 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:28:49,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 118 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:28:49,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-13 10:28:49,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2024-10-13 10:28:49,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 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-13 10:28:49,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2024-10-13 10:28:49,453 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2024-10-13 10:28:49,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:28:49,453 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2024-10-13 10:28:49,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 30 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:28:49,453 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2024-10-13 10:28:49,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-13 10:28:49,453 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:28:49,453 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:28:49,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-13 10:28:49,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-13 10:28:49,654 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-13 10:28:49,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:28:49,654 INFO L85 PathProgramCache]: Analyzing trace with hash 2014687221, now seen corresponding path program 5 times [2024-10-13 10:28:49,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:28:49,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497022181] [2024-10-13 10:28:49,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:28:49,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:28:49,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:28:50,142 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 4 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:50,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:28:50,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497022181] [2024-10-13 10:28:50,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497022181] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:28:50,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156634443] [2024-10-13 10:28:50,143 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-13 10:28:50,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:28:50,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:28:50,147 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:28:50,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-13 10:28:50,246 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2024-10-13 10:28:50,246 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:28:50,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 87 conjuncts are in the unsatisfiable core [2024-10-13 10:28:50,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:28:50,300 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-13 10:28:50,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:28:50,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-13 10:28:50,905 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 9 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:50,905 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:28:51,448 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:28:51,508 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 16 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:51,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156634443] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:28:51,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:28:51,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 43 [2024-10-13 10:28:51,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615870933] [2024-10-13 10:28:51,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:28:51,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-10-13 10:28:51,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:28:51,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-10-13 10:28:51,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1776, Unknown=0, NotChecked=0, Total=1980 [2024-10-13 10:28:51,512 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 45 states, 44 states have (on average 2.3181818181818183) internal successors, (102), 44 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:28:51,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:28:51,990 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2024-10-13 10:28:51,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 10:28:51,991 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.3181818181818183) internal successors, (102), 44 states have internal predecessors, (102), 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 34 [2024-10-13 10:28:51,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:28:51,991 INFO L225 Difference]: With dead ends: 39 [2024-10-13 10:28:51,991 INFO L226 Difference]: Without dead ends: 39 [2024-10-13 10:28:51,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 633 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=252, Invalid=2198, Unknown=0, NotChecked=0, Total=2450 [2024-10-13 10:28:51,992 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:28:51,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 91 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:28:51,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-13 10:28:51,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-10-13 10:28:51,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:28:51,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2024-10-13 10:28:51,998 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 34 [2024-10-13 10:28:51,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:28:51,999 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2024-10-13 10:28:51,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.3181818181818183) internal successors, (102), 44 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:28:51,999 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2024-10-13 10:28:51,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-13 10:28:51,999 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:28:51,999 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:28:52,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-13 10:28:52,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-10-13 10:28:52,200 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-13 10:28:52,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:28:52,201 INFO L85 PathProgramCache]: Analyzing trace with hash 354490925, now seen corresponding path program 6 times [2024-10-13 10:28:52,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:28:52,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277136295] [2024-10-13 10:28:52,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:28:52,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:28:52,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:28:52,614 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 41 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:52,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:28:52,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277136295] [2024-10-13 10:28:52,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277136295] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:28:52,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084818149] [2024-10-13 10:28:52,614 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-13 10:28:52,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:28:52,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:28:52,616 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:28:52,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-13 10:28:52,742 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2024-10-13 10:28:52,742 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:28:52,744 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-10-13 10:28:52,745 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:28:52,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-13 10:28:53,006 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 15 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:53,007 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:28:53,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-10-13 10:28:53,034 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 16 treesize of output 12 [2024-10-13 10:28:53,097 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 15 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:53,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084818149] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:28:53,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:28:53,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 33 [2024-10-13 10:28:53,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878989919] [2024-10-13 10:28:53,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:28:53,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-13 10:28:53,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:28:53,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-13 10:28:53,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=971, Unknown=0, NotChecked=0, Total=1056 [2024-10-13 10:28:53,099 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 33 states, 33 states have (on average 2.272727272727273) internal successors, (75), 33 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:28:53,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:28:53,714 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2024-10-13 10:28:53,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-13 10:28:53,715 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.272727272727273) internal successors, (75), 33 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-10-13 10:28:53,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:28:53,715 INFO L225 Difference]: With dead ends: 64 [2024-10-13 10:28:53,715 INFO L226 Difference]: Without dead ends: 42 [2024-10-13 10:28:53,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=206, Invalid=2244, Unknown=0, NotChecked=0, Total=2450 [2024-10-13 10:28:53,717 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 3 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:28:53,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 161 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:28:53,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-13 10:28:53,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2024-10-13 10:28:53,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.05) internal successors, (42), 40 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-13 10:28:53,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2024-10-13 10:28:53,719 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2024-10-13 10:28:53,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:28:53,719 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2024-10-13 10:28:53,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.272727272727273) internal successors, (75), 33 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:28:53,719 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2024-10-13 10:28:53,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-13 10:28:53,720 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:28:53,720 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:28:53,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-13 10:28:53,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-10-13 10:28:53,925 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-13 10:28:53,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:28:53,925 INFO L85 PathProgramCache]: Analyzing trace with hash 452553786, now seen corresponding path program 7 times [2024-10-13 10:28:53,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:28:53,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624008572] [2024-10-13 10:28:53,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:28:53,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:28:53,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:28:54,460 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 9 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:54,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:28:54,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624008572] [2024-10-13 10:28:54,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624008572] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:28:54,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787539588] [2024-10-13 10:28:54,461 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-13 10:28:54,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:28:54,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:28:54,463 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:28:54,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-13 10:28:54,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:28:54,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 102 conjuncts are in the unsatisfiable core [2024-10-13 10:28:54,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:28:54,615 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-13 10:28:54,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:28:54,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-13 10:28:55,356 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 16 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:55,356 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:28:55,959 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:28:56,002 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 25 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:56,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787539588] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:28:56,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:28:56,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 49 [2024-10-13 10:28:56,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374450172] [2024-10-13 10:28:56,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:28:56,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-10-13 10:28:56,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:28:56,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-10-13 10:28:56,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=2277, Unknown=0, NotChecked=0, Total=2550 [2024-10-13 10:28:56,005 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand has 51 states, 50 states have (on average 2.4) internal successors, (120), 50 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:28:56,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:28:56,509 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2024-10-13 10:28:56,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-13 10:28:56,521 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.4) internal successors, (120), 50 states have internal predecessors, (120), 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 40 [2024-10-13 10:28:56,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:28:56,522 INFO L225 Difference]: With dead ends: 45 [2024-10-13 10:28:56,522 INFO L226 Difference]: Without dead ends: 45 [2024-10-13 10:28:56,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 863 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=339, Invalid=2853, Unknown=0, NotChecked=0, Total=3192 [2024-10-13 10:28:56,523 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:28:56,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 106 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:28:56,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-13 10:28:56,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-10-13 10:28:56,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:28:56,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2024-10-13 10:28:56,524 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 40 [2024-10-13 10:28:56,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:28:56,524 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2024-10-13 10:28:56,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.4) internal successors, (120), 50 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:28:56,524 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2024-10-13 10:28:56,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-13 10:28:56,525 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:28:56,525 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:28:56,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-13 10:28:56,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-10-13 10:28:56,730 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-13 10:28:56,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:28:56,731 INFO L85 PathProgramCache]: Analyzing trace with hash -342676494, now seen corresponding path program 8 times [2024-10-13 10:28:56,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:28:56,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209002268] [2024-10-13 10:28:56,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:28:56,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:28:56,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:28:57,252 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 61 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:57,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:28:57,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209002268] [2024-10-13 10:28:57,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209002268] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:28:57,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476077323] [2024-10-13 10:28:57,252 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:28:57,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:28:57,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:28:57,255 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:28:57,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-13 10:28:57,370 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:28:57,370 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:28:57,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-10-13 10:28:57,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:28:57,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-13 10:28:57,702 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 7 treesize of output 3 [2024-10-13 10:28:57,725 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 18 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:57,725 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:28:57,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-10-13 10:28:57,780 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 16 treesize of output 12 [2024-10-13 10:28:57,856 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 18 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:57,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476077323] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:28:57,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:28:57,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 38 [2024-10-13 10:28:57,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369734534] [2024-10-13 10:28:57,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:28:57,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-13 10:28:57,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:28:57,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-13 10:28:57,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1305, Unknown=0, NotChecked=0, Total=1406 [2024-10-13 10:28:57,859 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand has 38 states, 38 states have (on average 2.3421052631578947) internal successors, (89), 38 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:28:58,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:28:58,716 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2024-10-13 10:28:58,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-13 10:28:58,716 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.3421052631578947) internal successors, (89), 38 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-10-13 10:28:58,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:28:58,717 INFO L225 Difference]: With dead ends: 74 [2024-10-13 10:28:58,717 INFO L226 Difference]: Without dead ends: 48 [2024-10-13 10:28:58,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=254, Invalid=3052, Unknown=0, NotChecked=0, Total=3306 [2024-10-13 10:28:58,718 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 1017 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:28:58,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 230 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1017 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 10:28:58,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-13 10:28:58,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2024-10-13 10:28:58,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 46 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-13 10:28:58,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2024-10-13 10:28:58,720 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2024-10-13 10:28:58,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:28:58,720 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2024-10-13 10:28:58,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.3421052631578947) internal successors, (89), 38 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:28:58,720 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2024-10-13 10:28:58,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-13 10:28:58,720 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:28:58,720 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:28:58,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-13 10:28:58,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:28:58,921 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-13 10:28:58,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:28:58,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1642659777, now seen corresponding path program 9 times [2024-10-13 10:28:58,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:28:58,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774047321] [2024-10-13 10:28:58,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:28:58,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:28:58,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:28:59,553 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 16 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:28:59,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:28:59,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774047321] [2024-10-13 10:28:59,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774047321] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:28:59,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306070494] [2024-10-13 10:28:59,555 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 10:28:59,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:28:59,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:28:59,556 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:28:59,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-13 10:28:59,714 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-10-13 10:28:59,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:28:59,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 147 conjuncts are in the unsatisfiable core [2024-10-13 10:28:59,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:28:59,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-13 10:28:59,771 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-13 10:28:59,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-13 10:29:00,803 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:29:00,803 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:29:01,587 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:29:01,637 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:29:01,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306070494] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:29:01,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:29:01,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 57 [2024-10-13 10:29:01,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669082697] [2024-10-13 10:29:01,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:29:01,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-10-13 10:29:01,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:29:01,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-10-13 10:29:01,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=3089, Unknown=0, NotChecked=0, Total=3422 [2024-10-13 10:29:01,640 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand has 59 states, 58 states have (on average 2.3793103448275863) internal successors, (138), 58 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:29:02,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:29:02,558 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2024-10-13 10:29:02,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-13 10:29:02,558 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 2.3793103448275863) internal successors, (138), 58 states have internal predecessors, (138), 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 46 [2024-10-13 10:29:02,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:29:02,559 INFO L225 Difference]: With dead ends: 54 [2024-10-13 10:29:02,560 INFO L226 Difference]: Without dead ends: 54 [2024-10-13 10:29:02,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1417 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=471, Invalid=4499, Unknown=0, NotChecked=0, Total=4970 [2024-10-13 10:29:02,565 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 8 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 1250 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 1255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 10:29:02,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 204 Invalid, 1255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1250 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 10:29:02,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-13 10:29:02,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2024-10-13 10:29:02,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:29:02,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2024-10-13 10:29:02,566 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 46 [2024-10-13 10:29:02,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:29:02,572 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2024-10-13 10:29:02,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 2.3793103448275863) internal successors, (138), 58 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:29:02,573 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2024-10-13 10:29:02,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-13 10:29:02,573 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:29:02,573 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:29:02,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-10-13 10:29:02,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:29:02,774 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-13 10:29:02,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:29:02,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1106430601, now seen corresponding path program 10 times [2024-10-13 10:29:02,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:29:02,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938362899] [2024-10-13 10:29:02,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:29:02,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:29:02,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:29:03,416 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 85 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:29:03,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:29:03,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938362899] [2024-10-13 10:29:03,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938362899] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:29:03,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895361944] [2024-10-13 10:29:03,417 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 10:29:03,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:29:03,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:29:03,418 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:29:03,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-13 10:29:03,651 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 10:29:03,651 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:29:03,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-10-13 10:29:03,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:29:03,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-13 10:29:04,076 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:29:04,077 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:29:04,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-10-13 10:29:04,110 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 16 treesize of output 12 [2024-10-13 10:29:04,189 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:29:04,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895361944] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:29:04,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:29:04,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 41 [2024-10-13 10:29:04,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635616364] [2024-10-13 10:29:04,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:29:04,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-13 10:29:04,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:29:04,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-13 10:29:04,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1528, Unknown=0, NotChecked=0, Total=1640 [2024-10-13 10:29:04,192 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand has 41 states, 41 states have (on average 2.4146341463414633) internal successors, (99), 41 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:29:05,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:29:05,209 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2024-10-13 10:29:05,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-13 10:29:05,210 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.4146341463414633) internal successors, (99), 41 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-10-13 10:29:05,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:29:05,210 INFO L225 Difference]: With dead ends: 84 [2024-10-13 10:29:05,210 INFO L226 Difference]: Without dead ends: 54 [2024-10-13 10:29:05,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=298, Invalid=3734, Unknown=0, NotChecked=0, Total=4032 [2024-10-13 10:29:05,212 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 3 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 1256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 10:29:05,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 273 Invalid, 1256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1239 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 10:29:05,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-13 10:29:05,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2024-10-13 10:29:05,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:29:05,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2024-10-13 10:29:05,214 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2024-10-13 10:29:05,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:29:05,214 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2024-10-13 10:29:05,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.4146341463414633) internal successors, (99), 41 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:29:05,214 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2024-10-13 10:29:05,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-13 10:29:05,215 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:29:05,215 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:29:05,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-10-13 10:29:05,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:29:05,420 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-13 10:29:05,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:29:05,420 INFO L85 PathProgramCache]: Analyzing trace with hash -727589884, now seen corresponding path program 11 times [2024-10-13 10:29:05,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:29:05,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000707845] [2024-10-13 10:29:05,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:29:05,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:29:05,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:29:06,137 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 25 proven. 129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:29:06,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:29:06,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000707845] [2024-10-13 10:29:06,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000707845] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:29:06,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809447833] [2024-10-13 10:29:06,138 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-13 10:29:06,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:29:06,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:29:06,140 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:29:06,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-13 10:29:06,406 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2024-10-13 10:29:06,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:29:06,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 163 conjuncts are in the unsatisfiable core [2024-10-13 10:29:06,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:29:06,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-13 10:29:06,450 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-13 10:29:06,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-13 10:29:07,548 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 36 proven. 118 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:29:07,549 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:29:08,421 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:29:08,479 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 49 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:29:08,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809447833] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:29:08,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:29:08,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 19] total 59 [2024-10-13 10:29:08,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342386695] [2024-10-13 10:29:08,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:29:08,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2024-10-13 10:29:08,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:29:08,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2024-10-13 10:29:08,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=3309, Unknown=0, NotChecked=0, Total=3660 [2024-10-13 10:29:08,482 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand has 61 states, 60 states have (on average 2.6) internal successors, (156), 60 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:29:09,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:29:09,270 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2024-10-13 10:29:09,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-13 10:29:09,271 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 2.6) internal successors, (156), 60 states have internal predecessors, (156), 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 52 [2024-10-13 10:29:09,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:29:09,271 INFO L225 Difference]: With dead ends: 57 [2024-10-13 10:29:09,271 INFO L226 Difference]: Without dead ends: 57 [2024-10-13 10:29:09,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1267 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=436, Invalid=4256, Unknown=0, NotChecked=0, Total=4692 [2024-10-13 10:29:09,272 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 10:29:09,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 156 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1083 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 10:29:09,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-10-13 10:29:09,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-10-13 10:29:09,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:29:09,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2024-10-13 10:29:09,274 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 52 [2024-10-13 10:29:09,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:29:09,274 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2024-10-13 10:29:09,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 2.6) internal successors, (156), 60 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:29:09,275 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2024-10-13 10:29:09,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-13 10:29:09,275 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:29:09,276 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:29:09,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-10-13 10:29:09,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-10-13 10:29:09,477 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-13 10:29:09,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:29:09,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1198872900, now seen corresponding path program 12 times [2024-10-13 10:29:09,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:29:09,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549254458] [2024-10-13 10:29:09,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:29:09,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:29:09,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:29:10,161 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 113 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:29:10,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:29:10,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549254458] [2024-10-13 10:29:10,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549254458] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:29:10,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698797307] [2024-10-13 10:29:10,162 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-13 10:29:10,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:29:10,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:29:10,163 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:29:10,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-10-13 10:29:10,496 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2024-10-13 10:29:10,496 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:29:10,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 88 conjuncts are in the unsatisfiable core [2024-10-13 10:29:10,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:29:10,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-13 10:29:11,041 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 24 proven. 161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:29:11,041 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:29:11,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-10-13 10:29:11,090 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 16 treesize of output 12 [2024-10-13 10:29:11,190 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 24 proven. 161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:29:11,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698797307] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:29:11,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:29:11,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 45 [2024-10-13 10:29:11,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29368613] [2024-10-13 10:29:11,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:29:11,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-10-13 10:29:11,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:29:11,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-10-13 10:29:11,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1853, Unknown=0, NotChecked=0, Total=1980 [2024-10-13 10:29:11,192 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand has 45 states, 45 states have (on average 2.466666666666667) internal successors, (111), 45 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:29:12,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:29:12,261 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2024-10-13 10:29:12,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-13 10:29:12,262 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.466666666666667) internal successors, (111), 45 states have internal predecessors, (111), 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 56 [2024-10-13 10:29:12,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:29:12,262 INFO L225 Difference]: With dead ends: 94 [2024-10-13 10:29:12,262 INFO L226 Difference]: Without dead ends: 60 [2024-10-13 10:29:12,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=350, Invalid=4620, Unknown=0, NotChecked=0, Total=4970 [2024-10-13 10:29:12,264 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 3 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 1369 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 1388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 10:29:12,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 301 Invalid, 1388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1369 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 10:29:12,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-13 10:29:12,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2024-10-13 10:29:12,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.0344827586206897) internal successors, (60), 58 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:29:12,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2024-10-13 10:29:12,269 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2024-10-13 10:29:12,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:29:12,269 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2024-10-13 10:29:12,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.466666666666667) internal successors, (111), 45 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:29:12,270 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2024-10-13 10:29:12,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-13 10:29:12,270 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:29:12,270 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:29:12,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-10-13 10:29:12,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:29:12,471 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-13 10:29:12,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:29:12,471 INFO L85 PathProgramCache]: Analyzing trace with hash -44470391, now seen corresponding path program 13 times [2024-10-13 10:29:12,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:29:12,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188107710] [2024-10-13 10:29:12,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:29:12,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:29:12,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:29:13,362 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 36 proven. 164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:29:13,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:29:13,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188107710] [2024-10-13 10:29:13,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188107710] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:29:13,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988565764] [2024-10-13 10:29:13,363 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-13 10:29:13,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:29:13,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:29:13,365 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:29:13,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-10-13 10:29:13,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:29:13,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 134 conjuncts are in the unsatisfiable core [2024-10-13 10:29:13,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:29:13,556 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-13 10:29:13,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:29:13,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-13 10:29:14,366 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 49 proven. 151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:29:14,366 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:29:15,292 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:29:15,333 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 64 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:29:15,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988565764] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:29:15,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:29:15,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 21] total 65 [2024-10-13 10:29:15,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179582486] [2024-10-13 10:29:15,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:29:15,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2024-10-13 10:29:15,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:29:15,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2024-10-13 10:29:15,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=4102, Unknown=0, NotChecked=0, Total=4422 [2024-10-13 10:29:15,336 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand has 67 states, 66 states have (on average 2.6363636363636362) internal successors, (174), 66 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:29:16,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:29:16,544 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2024-10-13 10:29:16,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-13 10:29:16,544 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 66 states have (on average 2.6363636363636362) internal successors, (174), 66 states have internal predecessors, (174), 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 58 [2024-10-13 10:29:16,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:29:16,545 INFO L225 Difference]: With dead ends: 63 [2024-10-13 10:29:16,545 INFO L226 Difference]: Without dead ends: 63 [2024-10-13 10:29:16,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1696 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=602, Invalid=6708, Unknown=0, NotChecked=0, Total=7310 [2024-10-13 10:29:16,546 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 4 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 1737 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 1748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 10:29:16,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 273 Invalid, 1748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1737 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 10:29:16,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-13 10:29:16,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-13 10:29:16,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:29:16,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2024-10-13 10:29:16,550 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 58 [2024-10-13 10:29:16,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:29:16,551 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2024-10-13 10:29:16,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 66 states have (on average 2.6363636363636362) internal successors, (174), 66 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:29:16,551 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2024-10-13 10:29:16,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-13 10:29:16,551 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:29:16,551 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:29:16,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-10-13 10:29:16,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:29:16,755 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-13 10:29:16,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:29:16,756 INFO L85 PathProgramCache]: Analyzing trace with hash -862785599, now seen corresponding path program 14 times [2024-10-13 10:29:16,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:29:16,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324057936] [2024-10-13 10:29:16,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:29:16,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:29:16,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:29:17,895 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 145 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:29:17,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:29:17,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324057936] [2024-10-13 10:29:17,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324057936] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:29:17,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129991108] [2024-10-13 10:29:17,896 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:29:17,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:29:17,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:29:17,897 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:29:17,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-10-13 10:29:18,032 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:29:18,033 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:29:18,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 102 conjuncts are in the unsatisfiable core [2024-10-13 10:29:18,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:29:18,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-13 10:29:18,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-13 10:29:18,642 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 27 proven. 208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:29:18,643 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:29:18,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-10-13 10:29:18,723 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 16 treesize of output 12 [2024-10-13 10:29:18,826 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 27 proven. 208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:29:18,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129991108] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:29:18,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:29:18,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 50 [2024-10-13 10:29:18,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131788439] [2024-10-13 10:29:18,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:29:18,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-13 10:29:18,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:29:18,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-13 10:29:18,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=2304, Unknown=0, NotChecked=0, Total=2450 [2024-10-13 10:29:18,828 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand has 50 states, 50 states have (on average 2.5) internal successors, (125), 50 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:29:20,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:29:20,273 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2024-10-13 10:29:20,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-13 10:29:20,274 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.5) internal successors, (125), 50 states have internal predecessors, (125), 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 62 [2024-10-13 10:29:20,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:29:20,275 INFO L225 Difference]: With dead ends: 104 [2024-10-13 10:29:20,275 INFO L226 Difference]: Without dead ends: 66 [2024-10-13 10:29:20,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1013 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=410, Invalid=5752, Unknown=0, NotChecked=0, Total=6162 [2024-10-13 10:29:20,276 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 2 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 1905 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 1927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 10:29:20,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 412 Invalid, 1927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1905 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 10:29:20,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-13 10:29:20,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2024-10-13 10:29:20,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.03125) internal successors, (66), 64 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:29:20,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2024-10-13 10:29:20,280 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 62 [2024-10-13 10:29:20,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:29:20,281 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2024-10-13 10:29:20,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.5) internal successors, (125), 50 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:29:20,281 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2024-10-13 10:29:20,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-13 10:29:20,281 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:29:20,281 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:29:20,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-10-13 10:29:20,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:29:20,482 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-13 10:29:20,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:29:20,483 INFO L85 PathProgramCache]: Analyzing trace with hash -108451122, now seen corresponding path program 15 times [2024-10-13 10:29:20,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:29:20,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013751945] [2024-10-13 10:29:20,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:29:20,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:29:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:29:21,657 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 49 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:29:21,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:29:21,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013751945] [2024-10-13 10:29:21,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013751945] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:29:21,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443378514] [2024-10-13 10:29:21,657 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 10:29:21,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:29:21,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:29:21,659 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:29:21,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-10-13 10:29:22,392 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2024-10-13 10:29:22,393 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:29:22,400 INFO L255 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 163 conjuncts are in the unsatisfiable core [2024-10-13 10:29:22,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:29:22,433 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-13 10:29:22,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:29:22,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-13 10:29:23,848 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 252 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:29:23,848 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:29:25,160 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:29:25,221 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 252 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:29:25,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443378514] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:29:25,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:29:25,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 75 [2024-10-13 10:29:25,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201720296] [2024-10-13 10:29:25,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:29:25,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2024-10-13 10:29:25,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:29:25,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2024-10-13 10:29:25,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=537, Invalid=5315, Unknown=0, NotChecked=0, Total=5852 [2024-10-13 10:29:25,223 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand has 77 states, 76 states have (on average 2.526315789473684) internal successors, (192), 76 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:29:26,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:29:26,819 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2024-10-13 10:29:26,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-10-13 10:29:26,820 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 76 states have (on average 2.526315789473684) internal successors, (192), 76 states have internal predecessors, (192), 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 64 [2024-10-13 10:29:26,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:29:26,820 INFO L225 Difference]: With dead ends: 72 [2024-10-13 10:29:26,820 INFO L226 Difference]: Without dead ends: 72 [2024-10-13 10:29:26,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2602 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=780, Invalid=8150, Unknown=0, NotChecked=0, Total=8930 [2024-10-13 10:29:26,822 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 8 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 1801 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 1809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 10:29:26,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 319 Invalid, 1809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1801 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 10:29:26,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-13 10:29:26,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2024-10-13 10:29:26,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:29:26,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2024-10-13 10:29:26,824 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 64 [2024-10-13 10:29:26,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:29:26,824 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2024-10-13 10:29:26,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 76 states have (on average 2.526315789473684) internal successors, (192), 76 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:29:26,824 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2024-10-13 10:29:26,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-13 10:29:26,825 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:29:26,825 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:29:26,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-10-13 10:29:27,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-10-13 10:29:27,026 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-13 10:29:27,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:29:27,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1748598918, now seen corresponding path program 16 times [2024-10-13 10:29:27,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:29:27,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861531080] [2024-10-13 10:29:27,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:29:27,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:29:27,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:29:28,047 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 181 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:29:28,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:29:28,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861531080] [2024-10-13 10:29:28,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861531080] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:29:28,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476412220] [2024-10-13 10:29:28,048 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 10:29:28,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:29:28,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:29:28,050 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:29:28,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-10-13 10:29:28,511 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 10:29:28,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:29:28,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 106 conjuncts are in the unsatisfiable core [2024-10-13 10:29:28,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:29:28,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-13 10:29:29,265 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 30 proven. 261 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:29:29,266 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:29:29,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-10-13 10:29:29,316 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 16 treesize of output 12 [2024-10-13 10:29:29,425 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 30 proven. 261 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:29:29,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476412220] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:29:29,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:29:29,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 53 [2024-10-13 10:29:29,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319368393] [2024-10-13 10:29:29,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:29:29,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-10-13 10:29:29,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:29:29,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-10-13 10:29:29,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2596, Unknown=0, NotChecked=0, Total=2756 [2024-10-13 10:29:29,428 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand has 53 states, 53 states have (on average 2.547169811320755) internal successors, (135), 53 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:29:31,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:29:31,207 INFO L93 Difference]: Finished difference Result 114 states and 115 transitions. [2024-10-13 10:29:31,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-13 10:29:31,207 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.547169811320755) internal successors, (135), 53 states have internal predecessors, (135), 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 68 [2024-10-13 10:29:31,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:29:31,208 INFO L225 Difference]: With dead ends: 114 [2024-10-13 10:29:31,208 INFO L226 Difference]: Without dead ends: 72 [2024-10-13 10:29:31,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1193 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=466, Invalid=6674, Unknown=0, NotChecked=0, Total=7140 [2024-10-13 10:29:31,209 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 2 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 2172 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 2198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 2172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 10:29:31,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 470 Invalid, 2198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 2172 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 10:29:31,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-13 10:29:31,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2024-10-13 10:29:31,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.0285714285714285) internal successors, (72), 70 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:29:31,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2024-10-13 10:29:31,211 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2024-10-13 10:29:31,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:29:31,211 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2024-10-13 10:29:31,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.547169811320755) internal successors, (135), 53 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:29:31,211 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2024-10-13 10:29:31,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-13 10:29:31,212 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:29:31,212 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:29:31,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2024-10-13 10:29:31,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-10-13 10:29:31,412 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-13 10:29:31,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:29:31,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1141407187, now seen corresponding path program 17 times [2024-10-13 10:29:31,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:29:31,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110008820] [2024-10-13 10:29:31,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:29:31,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:29:31,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:29:32,440 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 64 proven. 246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:29:32,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:29:32,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110008820] [2024-10-13 10:29:32,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110008820] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:29:32,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777454896] [2024-10-13 10:29:32,441 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-13 10:29:32,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:29:32,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:29:32,442 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:29:32,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-10-13 10:29:32,828 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2024-10-13 10:29:32,828 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:29:32,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 176 conjuncts are in the unsatisfiable core [2024-10-13 10:29:32,837 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:29:32,868 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-13 10:29:32,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:29:32,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-13 10:29:34,442 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:29:34,443 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:29:35,893 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:29:35,960 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:29:35,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777454896] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:29:35,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:29:35,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 81 [2024-10-13 10:29:35,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215270217] [2024-10-13 10:29:35,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:29:35,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2024-10-13 10:29:35,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:29:35,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2024-10-13 10:29:35,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=6255, Unknown=0, NotChecked=0, Total=6806 [2024-10-13 10:29:35,963 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand has 83 states, 82 states have (on average 2.5609756097560976) internal successors, (210), 82 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:29:37,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:29:37,632 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2024-10-13 10:29:37,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-10-13 10:29:37,633 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 82 states have (on average 2.5609756097560976) internal successors, (210), 82 states have internal predecessors, (210), 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 70 [2024-10-13 10:29:37,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:29:37,633 INFO L225 Difference]: With dead ends: 78 [2024-10-13 10:29:37,633 INFO L226 Difference]: Without dead ends: 78 [2024-10-13 10:29:37,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3038 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=822, Invalid=9684, Unknown=0, NotChecked=0, Total=10506 [2024-10-13 10:29:37,635 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 8 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 2435 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 2444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 10:29:37,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 413 Invalid, 2444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2435 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 10:29:37,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-13 10:29:37,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2024-10-13 10:29:37,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:29:37,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2024-10-13 10:29:37,641 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 70 [2024-10-13 10:29:37,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:29:37,641 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2024-10-13 10:29:37,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 82 states have (on average 2.5609756097560976) internal successors, (210), 82 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:29:37,641 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2024-10-13 10:29:37,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-13 10:29:37,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:29:37,642 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:29:37,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2024-10-13 10:29:37,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-10-13 10:29:37,842 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-13 10:29:37,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:29:37,843 INFO L85 PathProgramCache]: Analyzing trace with hash -316815093, now seen corresponding path program 18 times [2024-10-13 10:29:37,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:29:37,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463118732] [2024-10-13 10:29:37,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:29:37,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:29:37,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:29:38,910 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 221 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:29:38,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:29:38,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463118732] [2024-10-13 10:29:38,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463118732] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:29:38,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217791604] [2024-10-13 10:29:38,911 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-13 10:29:38,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:29:38,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:29:38,913 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:29:38,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-10-13 10:29:40,540 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2024-10-13 10:29:40,540 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:29:40,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 118 conjuncts are in the unsatisfiable core [2024-10-13 10:29:40,554 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:29:40,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-13 10:29:41,399 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 33 proven. 320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:29:41,399 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:29:41,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-10-13 10:29:41,447 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 16 treesize of output 12 [2024-10-13 10:29:41,555 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 33 proven. 320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:29:41,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217791604] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:29:41,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:29:41,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 57 [2024-10-13 10:29:41,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835812988] [2024-10-13 10:29:41,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:29:41,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-10-13 10:29:41,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:29:41,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-10-13 10:29:41,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=3014, Unknown=0, NotChecked=0, Total=3192 [2024-10-13 10:29:41,557 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand has 57 states, 57 states have (on average 2.5789473684210527) internal successors, (147), 57 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:29:43,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:29:43,534 INFO L93 Difference]: Finished difference Result 124 states and 125 transitions. [2024-10-13 10:29:43,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-10-13 10:29:43,534 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 2.5789473684210527) internal successors, (147), 57 states have internal predecessors, (147), 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 74 [2024-10-13 10:29:43,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:29:43,535 INFO L225 Difference]: With dead ends: 124 [2024-10-13 10:29:43,535 INFO L226 Difference]: Without dead ends: 78 [2024-10-13 10:29:43,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1407 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=530, Invalid=7842, Unknown=0, NotChecked=0, Total=8372 [2024-10-13 10:29:43,536 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 2 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 2426 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 2455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 10:29:43,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 519 Invalid, 2455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 2426 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 10:29:43,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-13 10:29:43,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2024-10-13 10:29:43,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.0263157894736843) internal successors, (78), 76 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:29:43,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2024-10-13 10:29:43,538 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2024-10-13 10:29:43,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:29:43,538 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2024-10-13 10:29:43,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 2.5789473684210527) internal successors, (147), 57 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:29:43,538 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2024-10-13 10:29:43,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-13 10:29:43,538 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:29:43,538 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:29:43,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2024-10-13 10:29:43,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:29:43,739 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-13 10:29:43,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:29:43,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1472538472, now seen corresponding path program 19 times [2024-10-13 10:29:43,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:29:43,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924851017] [2024-10-13 10:29:43,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:29:43,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:29:43,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:29:44,816 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 81 proven. 293 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:29:44,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:29:44,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924851017] [2024-10-13 10:29:44,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924851017] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:29:44,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064278454] [2024-10-13 10:29:44,817 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-13 10:29:44,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:29:44,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:29:44,818 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:29:44,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-10-13 10:29:44,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:29:44,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 173 conjuncts are in the unsatisfiable core [2024-10-13 10:29:44,997 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:29:45,034 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-13 10:29:45,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:29:45,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-13 10:29:45,953 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 100 proven. 274 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:29:45,954 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:29:47,087 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:29:47,156 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 121 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:29:47,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064278454] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:29:47,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:29:47,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27, 27] total 83 [2024-10-13 10:29:47,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865379957] [2024-10-13 10:29:47,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:29:47,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2024-10-13 10:29:47,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:29:47,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2024-10-13 10:29:47,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=503, Invalid=6637, Unknown=0, NotChecked=0, Total=7140 [2024-10-13 10:29:47,159 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand has 85 states, 84 states have (on average 2.7142857142857144) internal successors, (228), 84 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:29:48,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:29:48,704 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2024-10-13 10:29:48,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-10-13 10:29:48,704 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 84 states have (on average 2.7142857142857144) internal successors, (228), 84 states have internal predecessors, (228), 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 76 [2024-10-13 10:29:48,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:29:48,705 INFO L225 Difference]: With dead ends: 81 [2024-10-13 10:29:48,705 INFO L226 Difference]: Without dead ends: 81 [2024-10-13 10:29:48,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2950 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=965, Invalid=11025, Unknown=0, NotChecked=0, Total=11990 [2024-10-13 10:29:48,706 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 3 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 2492 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 2505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 10:29:48,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 402 Invalid, 2505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2492 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 10:29:48,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-13 10:29:48,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-10-13 10:29:48,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.025) internal successors, (82), 80 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-13 10:29:48,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2024-10-13 10:29:48,709 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 76 [2024-10-13 10:29:48,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:29:48,709 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2024-10-13 10:29:48,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 84 states have (on average 2.7142857142857144) internal successors, (228), 84 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:29:48,709 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2024-10-13 10:29:48,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-13 10:29:48,709 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:29:48,709 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:29:48,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2024-10-13 10:29:48,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:29:48,910 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-13 10:29:48,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:29:48,911 INFO L85 PathProgramCache]: Analyzing trace with hash -412403376, now seen corresponding path program 20 times [2024-10-13 10:29:48,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:29:48,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839747869] [2024-10-13 10:29:48,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:29:48,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:29:48,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:29:50,407 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 265 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:29:50,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:29:50,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839747869] [2024-10-13 10:29:50,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839747869] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:29:50,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903450508] [2024-10-13 10:29:50,408 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:29:50,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:29:50,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:29:50,409 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:29:50,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-10-13 10:29:50,573 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:29:50,573 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:29:50,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 128 conjuncts are in the unsatisfiable core [2024-10-13 10:29:50,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:29:50,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-13 10:29:51,524 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 36 proven. 385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:29:51,524 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:29:51,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-10-13 10:29:51,580 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 16 treesize of output 12 [2024-10-13 10:29:51,692 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 36 proven. 385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:29:51,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903450508] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:29:51,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:29:51,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 61 [2024-10-13 10:29:51,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839581863] [2024-10-13 10:29:51,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:29:51,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2024-10-13 10:29:51,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:29:51,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2024-10-13 10:29:51,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=3463, Unknown=0, NotChecked=0, Total=3660 [2024-10-13 10:29:51,695 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand has 61 states, 61 states have (on average 2.6065573770491803) internal successors, (159), 61 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:29:53,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:29:53,787 INFO L93 Difference]: Finished difference Result 134 states and 135 transitions. [2024-10-13 10:29:53,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-10-13 10:29:53,788 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 2.6065573770491803) internal successors, (159), 61 states have internal predecessors, (159), 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 80 [2024-10-13 10:29:53,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:29:53,788 INFO L225 Difference]: With dead ends: 134 [2024-10-13 10:29:53,788 INFO L226 Difference]: Without dead ends: 84 [2024-10-13 10:29:53,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1639 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=598, Invalid=9104, Unknown=0, NotChecked=0, Total=9702 [2024-10-13 10:29:53,789 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 2 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 2991 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 3023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 10:29:53,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 632 Invalid, 3023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2991 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 10:29:53,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-13 10:29:53,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2024-10-13 10:29:53,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:29:53,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2024-10-13 10:29:53,791 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2024-10-13 10:29:53,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:29:53,798 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2024-10-13 10:29:53,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 2.6065573770491803) internal successors, (159), 61 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:29:53,798 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2024-10-13 10:29:53,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-13 10:29:53,799 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:29:53,799 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:29:53,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2024-10-13 10:29:53,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2024-10-13 10:29:54,000 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-13 10:29:54,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:29:54,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1190155491, now seen corresponding path program 21 times [2024-10-13 10:29:54,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:29:54,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977829463] [2024-10-13 10:29:54,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:29:54,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:29:54,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:29:55,238 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 100 proven. 344 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:29:55,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:29:55,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977829463] [2024-10-13 10:29:55,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977829463] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:29:55,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271826866] [2024-10-13 10:29:55,238 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 10:29:55,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:29:55,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:29:55,240 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:29:55,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-10-13 10:29:57,578 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2024-10-13 10:29:57,578 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:29:57,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 257 conjuncts are in the unsatisfiable core [2024-10-13 10:29:57,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:29:57,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-13 10:29:57,645 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-13 10:30:00,255 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:30:00,255 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:30:02,896 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:30:02,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271826866] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:30:02,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:30:02,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32, 32] total 95 [2024-10-13 10:30:02,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045400062] [2024-10-13 10:30:02,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:30:02,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2024-10-13 10:30:02,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:30:02,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2024-10-13 10:30:02,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=512, Invalid=8800, Unknown=0, NotChecked=0, Total=9312 [2024-10-13 10:30:02,899 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand has 97 states, 96 states have (on average 2.5625) internal successors, (246), 96 states have internal predecessors, (246), 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)