./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cstrcmp-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/array-memsafety/openbsd_cstrcmp-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 34ebd55fb329f5d1f91a7448416ebb87d44ad143bdc373b65c05d35b2199abdd --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:33:55,936 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:33:55,992 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 07:33:55,997 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:33:55,997 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:33:56,021 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:33:56,023 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:33:56,023 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:33:56,024 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:33:56,025 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:33:56,025 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:33:56,025 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:33:56,026 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:33:56,026 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:33:56,027 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:33:56,028 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:33:56,028 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:33:56,028 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:33:56,028 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:33:56,028 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:33:56,029 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:33:56,031 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:33:56,032 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:33:56,032 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:33:56,032 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:33:56,032 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:33:56,032 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:33:56,032 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:33:56,033 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:33:56,033 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:33:56,033 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:33:56,033 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:33:56,033 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:33:56,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:33:56,034 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:33:56,034 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:33:56,034 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:33:56,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:33:56,034 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:33:56,034 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:33:56,035 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:33:56,035 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:33:56,036 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 -> 34ebd55fb329f5d1f91a7448416ebb87d44ad143bdc373b65c05d35b2199abdd [2024-11-09 07:33:56,225 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:33:56,245 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:33:56,248 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:33:56,249 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:33:56,249 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:33:56,250 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstrcmp-alloca-1.i [2024-11-09 07:33:57,446 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:33:57,616 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:33:57,616 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrcmp-alloca-1.i [2024-11-09 07:33:57,626 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d5d756ef/10aeb931525245a6b4c83438dd8904aa/FLAG347e224df [2024-11-09 07:33:58,010 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d5d756ef/10aeb931525245a6b4c83438dd8904aa [2024-11-09 07:33:58,012 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:33:58,013 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:33:58,015 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:33:58,015 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:33:58,019 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:33:58,020 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:33:58" (1/1) ... [2024-11-09 07:33:58,020 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c9c046b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:33:58, skipping insertion in model container [2024-11-09 07:33:58,020 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:33:58" (1/1) ... [2024-11-09 07:33:58,051 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:33:58,329 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:33:58,330 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:33:58,353 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:33:58,361 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:33:58,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:33:58,423 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:33:58,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:33:58 WrapperNode [2024-11-09 07:33:58,424 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:33:58,425 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:33:58,425 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:33:58,425 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:33:58,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:33:58" (1/1) ... [2024-11-09 07:33:58,443 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:33:58" (1/1) ... [2024-11-09 07:33:58,459 INFO L138 Inliner]: procedures = 117, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 100 [2024-11-09 07:33:58,459 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:33:58,460 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:33:58,460 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:33:58,460 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:33:58,468 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:33:58" (1/1) ... [2024-11-09 07:33:58,469 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:33:58" (1/1) ... [2024-11-09 07:33:58,473 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:33:58" (1/1) ... [2024-11-09 07:33:58,487 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [5, 4]. 56 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 4 writes are split as follows [2, 2]. [2024-11-09 07:33:58,487 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:33:58" (1/1) ... [2024-11-09 07:33:58,488 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:33:58" (1/1) ... [2024-11-09 07:33:58,494 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:33:58" (1/1) ... [2024-11-09 07:33:58,497 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:33:58" (1/1) ... [2024-11-09 07:33:58,498 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:33:58" (1/1) ... [2024-11-09 07:33:58,502 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:33:58" (1/1) ... [2024-11-09 07:33:58,503 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:33:58,504 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:33:58,504 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:33:58,506 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:33:58,506 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:33:58" (1/1) ... [2024-11-09 07:33:58,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:33:58,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:33:58,534 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 07:33:58,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 07:33:58,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 07:33:58,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 07:33:58,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 07:33:58,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 07:33:58,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 07:33:58,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:33:58,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:33:58,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:33:58,646 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:33:58,648 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:33:58,810 INFO L? ?]: Removed 62 outVars from TransFormulas that were not future-live. [2024-11-09 07:33:58,811 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:33:58,820 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:33:58,821 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-09 07:33:58,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:33:58 BoogieIcfgContainer [2024-11-09 07:33:58,822 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:33:58,825 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:33:58,825 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:33:58,828 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:33:58,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:33:58" (1/3) ... [2024-11-09 07:33:58,828 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11de8cd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:33:58, skipping insertion in model container [2024-11-09 07:33:58,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:33:58" (2/3) ... [2024-11-09 07:33:58,829 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11de8cd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:33:58, skipping insertion in model container [2024-11-09 07:33:58,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:33:58" (3/3) ... [2024-11-09 07:33:58,830 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcmp-alloca-1.i [2024-11-09 07:33:58,843 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:33:58,843 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 19 error locations. [2024-11-09 07:33:58,873 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:33:58,877 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;@27676f6b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:33:58,877 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2024-11-09 07:33:58,880 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 31 states have (on average 1.903225806451613) internal successors, (59), 50 states have internal predecessors, (59), 0 states have call successors, (0), 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-11-09 07:33:58,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 07:33:58,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:33:58,884 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:33:58,884 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 07:33:58,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:33:58,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029096, now seen corresponding path program 1 times [2024-11-09 07:33:58,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:33:58,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481449370] [2024-11-09 07:33:58,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:33:58,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:33:59,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:33:59,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:33:59,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:33:59,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481449370] [2024-11-09 07:33:59,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481449370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:33:59,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:33:59,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:33:59,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238992177] [2024-11-09 07:33:59,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:33:59,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:33:59,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:33:59,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:33:59,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:33:59,184 INFO L87 Difference]: Start difference. First operand has 51 states, 31 states have (on average 1.903225806451613) internal successors, (59), 50 states have internal predecessors, (59), 0 states have call successors, (0), 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.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-11-09 07:33:59,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:33:59,249 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2024-11-09 07:33:59,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:33:59,251 INFO L78 Accepts]: Start accepts. Automaton has has 4 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-11-09 07:33:59,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:33:59,258 INFO L225 Difference]: With dead ends: 64 [2024-11-09 07:33:59,258 INFO L226 Difference]: Without dead ends: 62 [2024-11-09 07:33:59,260 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-11-09 07:33:59,265 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 12 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 142 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-11-09 07:33:59,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 142 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:33:59,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-09 07:33:59,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2024-11-09 07:33:59,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 51 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-11-09 07:33:59,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2024-11-09 07:33:59,289 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 7 [2024-11-09 07:33:59,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:33:59,289 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2024-11-09 07:33:59,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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-11-09 07:33:59,289 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2024-11-09 07:33:59,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 07:33:59,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:33:59,290 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:33:59,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:33:59,290 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 07:33:59,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:33:59,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1806876138, now seen corresponding path program 1 times [2024-11-09 07:33:59,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:33:59,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387899195] [2024-11-09 07:33:59,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:33:59,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:33:59,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:33:59,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:33:59,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:33:59,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387899195] [2024-11-09 07:33:59,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387899195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:33:59,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:33:59,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:33:59,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745247073] [2024-11-09 07:33:59,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:33:59,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:33:59,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:33:59,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:33:59,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:33:59,427 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-11-09 07:33:59,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:33:59,472 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2024-11-09 07:33:59,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:33:59,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-11-09 07:33:59,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:33:59,473 INFO L225 Difference]: With dead ends: 50 [2024-11-09 07:33:59,474 INFO L226 Difference]: Without dead ends: 50 [2024-11-09 07:33:59,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:33:59,475 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 17 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 59 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-11-09 07:33:59,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 59 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:33:59,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-09 07:33:59,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-09 07:33:59,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.696969696969697) internal successors, (56), 49 states have internal predecessors, (56), 0 states have call successors, (0), 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-11-09 07:33:59,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2024-11-09 07:33:59,482 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 7 [2024-11-09 07:33:59,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:33:59,483 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2024-11-09 07:33:59,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-11-09 07:33:59,483 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2024-11-09 07:33:59,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 07:33:59,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:33:59,484 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:33:59,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:33:59,485 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 07:33:59,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:33:59,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1806876139, now seen corresponding path program 1 times [2024-11-09 07:33:59,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:33:59,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270621323] [2024-11-09 07:33:59,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:33:59,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:33:59,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:33:59,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:33:59,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:33:59,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270621323] [2024-11-09 07:33:59,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270621323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:33:59,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:33:59,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:33:59,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303047803] [2024-11-09 07:33:59,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:33:59,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:33:59,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:33:59,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:33:59,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:33:59,738 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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-11-09 07:33:59,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:33:59,829 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2024-11-09 07:33:59,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:33:59,830 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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-11-09 07:33:59,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:33:59,830 INFO L225 Difference]: With dead ends: 54 [2024-11-09 07:33:59,830 INFO L226 Difference]: Without dead ends: 54 [2024-11-09 07:33:59,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-11-09 07:33:59,831 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 23 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:33:59,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 122 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:33:59,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-09 07:33:59,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2024-11-09 07:33:59,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 51 states have internal predecessors, (59), 0 states have call successors, (0), 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-11-09 07:33:59,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2024-11-09 07:33:59,835 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 7 [2024-11-09 07:33:59,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:33:59,836 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2024-11-09 07:33:59,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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-11-09 07:33:59,836 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2024-11-09 07:33:59,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 07:33:59,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:33:59,837 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:33:59,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:33:59,837 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 07:33:59,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:33:59,840 INFO L85 PathProgramCache]: Analyzing trace with hash -533876908, now seen corresponding path program 1 times [2024-11-09 07:33:59,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:33:59,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696274332] [2024-11-09 07:33:59,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:33:59,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:33:59,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:33:59,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:33:59,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:33:59,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696274332] [2024-11-09 07:33:59,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696274332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:33:59,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:33:59,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:33:59,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787965262] [2024-11-09 07:33:59,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:33:59,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:33:59,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:33:59,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:33:59,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:33:59,889 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 4 states, 4 states have (on average 2.25) 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-11-09 07:33:59,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:33:59,912 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2024-11-09 07:33:59,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:33:59,914 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) 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-11-09 07:33:59,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:33:59,915 INFO L225 Difference]: With dead ends: 69 [2024-11-09 07:33:59,915 INFO L226 Difference]: Without dead ends: 69 [2024-11-09 07:33:59,915 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-11-09 07:33:59,917 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 10 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:33:59,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 101 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:33:59,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-09 07:33:59,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2024-11-09 07:33:59,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 46 states have (on average 1.5869565217391304) internal successors, (73), 62 states have internal predecessors, (73), 0 states have call successors, (0), 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-11-09 07:33:59,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2024-11-09 07:33:59,922 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 9 [2024-11-09 07:33:59,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:33:59,922 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2024-11-09 07:33:59,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) 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-11-09 07:33:59,923 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2024-11-09 07:33:59,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 07:33:59,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:33:59,925 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:33:59,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:33:59,925 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 07:33:59,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:33:59,926 INFO L85 PathProgramCache]: Analyzing trace with hash -476618606, now seen corresponding path program 1 times [2024-11-09 07:33:59,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:33:59,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040854259] [2024-11-09 07:33:59,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:33:59,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:33:59,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:33:59,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:33:59,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:33:59,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040854259] [2024-11-09 07:33:59,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040854259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:33:59,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:33:59,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:33:59,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899410299] [2024-11-09 07:33:59,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:33:59,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:33:59,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:33:59,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:33:59,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:33:59,958 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-11-09 07:33:59,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:33:59,991 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2024-11-09 07:33:59,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:33:59,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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-11-09 07:33:59,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:33:59,992 INFO L225 Difference]: With dead ends: 61 [2024-11-09 07:33:59,992 INFO L226 Difference]: Without dead ends: 61 [2024-11-09 07:33:59,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:33:59,993 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 13 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:33:59,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 59 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:33:59,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-09 07:34:00,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-09 07:34:00,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 60 states have internal predecessors, (71), 0 states have call successors, (0), 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-11-09 07:34:00,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2024-11-09 07:34:00,004 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 9 [2024-11-09 07:34:00,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:00,004 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2024-11-09 07:34:00,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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-11-09 07:34:00,004 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2024-11-09 07:34:00,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 07:34:00,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:00,004 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:00,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:34:00,005 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 07:34:00,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:00,005 INFO L85 PathProgramCache]: Analyzing trace with hash -476618605, now seen corresponding path program 1 times [2024-11-09 07:34:00,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:00,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060458576] [2024-11-09 07:34:00,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:00,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:00,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:00,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:00,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:00,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060458576] [2024-11-09 07:34:00,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060458576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:34:00,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:34:00,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:34:00,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653789070] [2024-11-09 07:34:00,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:34:00,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:34:00,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:00,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:34:00,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:34:00,130 INFO L87 Difference]: Start difference. First operand 61 states and 71 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-11-09 07:34:00,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:00,203 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2024-11-09 07:34:00,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:34:00,206 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-11-09 07:34:00,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:00,207 INFO L225 Difference]: With dead ends: 65 [2024-11-09 07:34:00,207 INFO L226 Difference]: Without dead ends: 65 [2024-11-09 07:34:00,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:34:00,207 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 25 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:00,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 106 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:34:00,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-09 07:34:00,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2024-11-09 07:34:00,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.5416666666666667) internal successors, (74), 62 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:00,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2024-11-09 07:34:00,214 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 9 [2024-11-09 07:34:00,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:00,214 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2024-11-09 07:34:00,214 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-11-09 07:34:00,214 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2024-11-09 07:34:00,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 07:34:00,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:00,215 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:00,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:34:00,215 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 07:34:00,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:00,216 INFO L85 PathProgramCache]: Analyzing trace with hash 629683416, now seen corresponding path program 1 times [2024-11-09 07:34:00,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:00,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665891924] [2024-11-09 07:34:00,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:00,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:00,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:00,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:00,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:00,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665891924] [2024-11-09 07:34:00,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665891924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:34:00,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:34:00,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:34:00,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842275732] [2024-11-09 07:34:00,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:34:00,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:34:00,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:00,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:34:00,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:34:00,293 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:00,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:00,340 INFO L93 Difference]: Finished difference Result 75 states and 88 transitions. [2024-11-09 07:34:00,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:34:00,341 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-09 07:34:00,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:00,341 INFO L225 Difference]: With dead ends: 75 [2024-11-09 07:34:00,341 INFO L226 Difference]: Without dead ends: 75 [2024-11-09 07:34:00,342 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-11-09 07:34:00,342 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 6 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:00,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 112 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:34:00,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-09 07:34:00,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2024-11-09 07:34:00,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 59 states have (on average 1.4915254237288136) internal successors, (88), 73 states have internal predecessors, (88), 0 states have call successors, (0), 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-11-09 07:34:00,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 88 transitions. [2024-11-09 07:34:00,346 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 88 transitions. Word has length 10 [2024-11-09 07:34:00,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:00,346 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 88 transitions. [2024-11-09 07:34:00,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:00,346 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 88 transitions. [2024-11-09 07:34:00,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 07:34:00,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:00,347 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:00,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:34:00,347 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 07:34:00,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:00,348 INFO L85 PathProgramCache]: Analyzing trace with hash -179663210, now seen corresponding path program 1 times [2024-11-09 07:34:00,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:00,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281392301] [2024-11-09 07:34:00,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:00,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:00,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:00,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:00,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:00,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281392301] [2024-11-09 07:34:00,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281392301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:34:00,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:34:00,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:34:00,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455316055] [2024-11-09 07:34:00,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:34:00,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:34:00,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:00,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:34:00,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:34:00,454 INFO L87 Difference]: Start difference. First operand 74 states and 88 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-11-09 07:34:00,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:00,501 INFO L93 Difference]: Finished difference Result 90 states and 106 transitions. [2024-11-09 07:34:00,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:34:00,501 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-11-09 07:34:00,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:00,502 INFO L225 Difference]: With dead ends: 90 [2024-11-09 07:34:00,502 INFO L226 Difference]: Without dead ends: 90 [2024-11-09 07:34:00,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-11-09 07:34:00,503 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 27 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:00,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 101 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:34:00,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-09 07:34:00,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 74. [2024-11-09 07:34:00,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 59 states have (on average 1.4915254237288136) internal successors, (88), 73 states have internal predecessors, (88), 0 states have call successors, (0), 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-11-09 07:34:00,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 88 transitions. [2024-11-09 07:34:00,509 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 88 transitions. Word has length 10 [2024-11-09 07:34:00,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:00,511 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 88 transitions. [2024-11-09 07:34:00,512 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-11-09 07:34:00,512 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 88 transitions. [2024-11-09 07:34:00,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 07:34:00,512 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:00,512 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:00,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 07:34:00,512 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 07:34:00,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:00,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1954650589, now seen corresponding path program 1 times [2024-11-09 07:34:00,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:00,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479740622] [2024-11-09 07:34:00,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:00,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:00,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:00,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:00,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:00,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479740622] [2024-11-09 07:34:00,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479740622] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:34:00,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:34:00,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:34:00,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909165679] [2024-11-09 07:34:00,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:34:00,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:34:00,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:00,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:34:00,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:34:00,583 INFO L87 Difference]: Start difference. First operand 74 states and 88 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:00,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:00,618 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2024-11-09 07:34:00,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:34:00,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 07:34:00,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:00,619 INFO L225 Difference]: With dead ends: 81 [2024-11-09 07:34:00,619 INFO L226 Difference]: Without dead ends: 81 [2024-11-09 07:34:00,619 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-11-09 07:34:00,619 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:00,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 110 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:34:00,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-09 07:34:00,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2024-11-09 07:34:00,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 64 states have (on average 1.46875) internal successors, (94), 78 states have internal predecessors, (94), 0 states have call successors, (0), 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-11-09 07:34:00,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 94 transitions. [2024-11-09 07:34:00,623 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 94 transitions. Word has length 11 [2024-11-09 07:34:00,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:00,623 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 94 transitions. [2024-11-09 07:34:00,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:00,623 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2024-11-09 07:34:00,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 07:34:00,624 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:00,624 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:00,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:34:00,624 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 07:34:00,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:00,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1530970081, now seen corresponding path program 1 times [2024-11-09 07:34:00,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:00,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412965317] [2024-11-09 07:34:00,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:00,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:00,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:00,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:00,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:00,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412965317] [2024-11-09 07:34:00,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412965317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:34:00,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:34:00,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:34:00,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157635919] [2024-11-09 07:34:00,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:34:00,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:34:00,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:00,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:34:00,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:34:00,695 INFO L87 Difference]: Start difference. First operand 79 states and 94 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:00,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:00,714 INFO L93 Difference]: Finished difference Result 78 states and 93 transitions. [2024-11-09 07:34:00,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:34:00,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 07:34:00,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:00,715 INFO L225 Difference]: With dead ends: 78 [2024-11-09 07:34:00,715 INFO L226 Difference]: Without dead ends: 78 [2024-11-09 07:34:00,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-11-09 07:34:00,716 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 22 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:00,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 91 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:34:00,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-09 07:34:00,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2024-11-09 07:34:00,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 59 states have (on average 1.4745762711864407) internal successors, (87), 72 states have internal predecessors, (87), 0 states have call successors, (0), 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-11-09 07:34:00,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 87 transitions. [2024-11-09 07:34:00,722 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 87 transitions. Word has length 11 [2024-11-09 07:34:00,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:00,722 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 87 transitions. [2024-11-09 07:34:00,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:00,723 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2024-11-09 07:34:00,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 07:34:00,723 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:00,723 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:00,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 07:34:00,723 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 07:34:00,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:00,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1226025170, now seen corresponding path program 1 times [2024-11-09 07:34:00,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:00,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903520459] [2024-11-09 07:34:00,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:00,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:00,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:00,876 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:00,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:00,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903520459] [2024-11-09 07:34:00,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903520459] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:34:00,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294274889] [2024-11-09 07:34:00,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:00,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:34:00,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:34:00,879 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:34:00,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 07:34:00,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:00,926 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 07:34:00,935 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:34:01,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:34:01,029 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-11-09 07:34:01,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-09 07:34:01,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:01,161 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:34:01,294 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:34:01,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:01,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294274889] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:34:01,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:34:01,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-11-09 07:34:01,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442168303] [2024-11-09 07:34:01,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:34:01,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 07:34:01,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:01,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 07:34:01,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:34:01,309 INFO L87 Difference]: Start difference. First operand 73 states and 87 transitions. Second operand has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 13 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-11-09 07:34:01,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:01,472 INFO L93 Difference]: Finished difference Result 78 states and 93 transitions. [2024-11-09 07:34:01,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:34:01,472 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 13 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) Word has length 11 [2024-11-09 07:34:01,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:01,473 INFO L225 Difference]: With dead ends: 78 [2024-11-09 07:34:01,473 INFO L226 Difference]: Without dead ends: 78 [2024-11-09 07:34:01,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2024-11-09 07:34:01,474 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 34 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:01,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 209 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:34:01,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-09 07:34:01,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 70. [2024-11-09 07:34:01,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 57 states have (on average 1.456140350877193) internal successors, (83), 69 states have internal predecessors, (83), 0 states have call successors, (0), 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-11-09 07:34:01,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2024-11-09 07:34:01,476 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 11 [2024-11-09 07:34:01,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:01,476 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2024-11-09 07:34:01,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 13 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-11-09 07:34:01,477 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2024-11-09 07:34:01,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 07:34:01,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:01,477 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:01,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 07:34:01,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-09 07:34:01,680 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 07:34:01,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:01,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1518507737, now seen corresponding path program 1 times [2024-11-09 07:34:01,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:01,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745481939] [2024-11-09 07:34:01,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:01,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:01,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:01,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:01,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:01,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745481939] [2024-11-09 07:34:01,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745481939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:34:01,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:34:01,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:34:01,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969112475] [2024-11-09 07:34:01,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:34:01,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:34:01,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:01,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:34:01,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:34:01,720 INFO L87 Difference]: Start difference. First operand 70 states and 83 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-11-09 07:34:01,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:01,753 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2024-11-09 07:34:01,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:34:01,754 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-11-09 07:34:01,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:01,754 INFO L225 Difference]: With dead ends: 69 [2024-11-09 07:34:01,754 INFO L226 Difference]: Without dead ends: 69 [2024-11-09 07:34:01,754 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-11-09 07:34:01,755 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 24 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:01,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 61 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:34:01,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-09 07:34:01,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2024-11-09 07:34:01,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 67 states have internal predecessors, (81), 0 states have call successors, (0), 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-11-09 07:34:01,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 81 transitions. [2024-11-09 07:34:01,760 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 81 transitions. Word has length 13 [2024-11-09 07:34:01,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:01,760 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 81 transitions. [2024-11-09 07:34:01,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-11-09 07:34:01,760 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2024-11-09 07:34:01,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 07:34:01,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:01,761 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:01,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 07:34:01,761 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 07:34:01,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:01,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1518507736, now seen corresponding path program 1 times [2024-11-09 07:34:01,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:01,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635339518] [2024-11-09 07:34:01,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:01,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:01,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:01,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:01,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:01,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635339518] [2024-11-09 07:34:01,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635339518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:34:01,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:34:01,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:34:01,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959184431] [2024-11-09 07:34:01,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:34:01,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:34:01,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:01,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:34:01,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:34:01,847 INFO L87 Difference]: Start difference. First operand 68 states and 81 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 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-11-09 07:34:01,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:01,905 INFO L93 Difference]: Finished difference Result 78 states and 91 transitions. [2024-11-09 07:34:01,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:34:01,905 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 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-11-09 07:34:01,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:01,906 INFO L225 Difference]: With dead ends: 78 [2024-11-09 07:34:01,906 INFO L226 Difference]: Without dead ends: 78 [2024-11-09 07:34:01,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:34:01,907 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 37 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:01,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 111 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:34:01,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-09 07:34:01,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2024-11-09 07:34:01,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 62 states have (on average 1.435483870967742) internal successors, (89), 72 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-11-09 07:34:01,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 89 transitions. [2024-11-09 07:34:01,909 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 89 transitions. Word has length 13 [2024-11-09 07:34:01,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:01,909 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 89 transitions. [2024-11-09 07:34:01,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 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-11-09 07:34:01,909 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2024-11-09 07:34:01,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 07:34:01,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:01,909 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:01,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 07:34:01,910 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 07:34:01,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:01,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1862804906, now seen corresponding path program 1 times [2024-11-09 07:34:01,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:01,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998687623] [2024-11-09 07:34:01,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:01,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:01,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:02,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:02,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:02,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998687623] [2024-11-09 07:34:02,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998687623] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:34:02,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450207717] [2024-11-09 07:34:02,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:02,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:34:02,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:34:02,056 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:34:02,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 07:34:02,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:02,105 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 07:34:02,107 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:34:02,125 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 7 [2024-11-09 07:34:02,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-11-09 07:34:02,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:02,264 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:34:02,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:02,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450207717] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:34:02,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:34:02,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2024-11-09 07:34:02,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758542176] [2024-11-09 07:34:02,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:34:02,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 07:34:02,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:02,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 07:34:02,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-11-09 07:34:02,417 INFO L87 Difference]: Start difference. First operand 73 states and 89 transitions. Second operand has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 16 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-11-09 07:34:02,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:02,567 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2024-11-09 07:34:02,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:34:02,567 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 07:34:02,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:02,569 INFO L225 Difference]: With dead ends: 78 [2024-11-09 07:34:02,569 INFO L226 Difference]: Without dead ends: 78 [2024-11-09 07:34:02,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2024-11-09 07:34:02,570 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 39 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:02,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 182 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:34:02,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-09 07:34:02,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 68. [2024-11-09 07:34:02,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 58 states have (on average 1.396551724137931) internal successors, (81), 67 states have internal predecessors, (81), 0 states have call successors, (0), 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-11-09 07:34:02,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 81 transitions. [2024-11-09 07:34:02,572 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 81 transitions. Word has length 13 [2024-11-09 07:34:02,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:02,572 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 81 transitions. [2024-11-09 07:34:02,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 16 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-11-09 07:34:02,573 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2024-11-09 07:34:02,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 07:34:02,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:02,573 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:02,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 07:34:02,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-09 07:34:02,774 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 07:34:02,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:02,775 INFO L85 PathProgramCache]: Analyzing trace with hash -115553677, now seen corresponding path program 1 times [2024-11-09 07:34:02,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:02,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025944639] [2024-11-09 07:34:02,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:02,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:02,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:02,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:02,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:02,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025944639] [2024-11-09 07:34:02,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025944639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:34:02,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:34:02,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:34:02,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114571559] [2024-11-09 07:34:02,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:34:02,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:34:02,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:02,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:34:02,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:34:02,920 INFO L87 Difference]: Start difference. First operand 68 states and 81 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:02,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:02,953 INFO L93 Difference]: Finished difference Result 67 states and 80 transitions. [2024-11-09 07:34:02,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:34:02,954 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-09 07:34:02,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:02,954 INFO L225 Difference]: With dead ends: 67 [2024-11-09 07:34:02,954 INFO L226 Difference]: Without dead ends: 67 [2024-11-09 07:34:02,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:34:02,955 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 10 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:02,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 80 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:34:02,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-09 07:34:02,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 56. [2024-11-09 07:34:02,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 55 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-11-09 07:34:02,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2024-11-09 07:34:02,957 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 14 [2024-11-09 07:34:02,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:02,957 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2024-11-09 07:34:02,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:02,957 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2024-11-09 07:34:02,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 07:34:02,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:02,960 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:02,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 07:34:02,960 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 07:34:02,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:02,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1002946536, now seen corresponding path program 1 times [2024-11-09 07:34:02,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:02,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065003450] [2024-11-09 07:34:02,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:02,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:02,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:03,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:03,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:03,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065003450] [2024-11-09 07:34:03,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065003450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:34:03,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:34:03,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:34:03,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92735074] [2024-11-09 07:34:03,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:34:03,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:34:03,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:03,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:34:03,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:34:03,043 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:03,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:03,080 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2024-11-09 07:34:03,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:34:03,081 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 07:34:03,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:03,081 INFO L225 Difference]: With dead ends: 56 [2024-11-09 07:34:03,081 INFO L226 Difference]: Without dead ends: 56 [2024-11-09 07:34:03,081 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-11-09 07:34:03,082 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 25 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:03,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 79 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:34:03,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-09 07:34:03,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2024-11-09 07:34:03,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 54 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-11-09 07:34:03,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2024-11-09 07:34:03,085 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 15 [2024-11-09 07:34:03,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:03,085 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2024-11-09 07:34:03,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:03,085 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2024-11-09 07:34:03,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 07:34:03,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:03,088 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:03,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 07:34:03,088 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 07:34:03,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:03,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1002946537, now seen corresponding path program 1 times [2024-11-09 07:34:03,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:03,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657302910] [2024-11-09 07:34:03,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:03,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:03,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:03,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:03,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:03,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657302910] [2024-11-09 07:34:03,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657302910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:34:03,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:34:03,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:34:03,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011076401] [2024-11-09 07:34:03,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:34:03,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:34:03,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:03,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:34:03,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:34:03,210 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:03,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:03,277 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2024-11-09 07:34:03,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:34:03,277 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 07:34:03,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:03,278 INFO L225 Difference]: With dead ends: 60 [2024-11-09 07:34:03,278 INFO L226 Difference]: Without dead ends: 60 [2024-11-09 07:34:03,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:34:03,279 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 22 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:03,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 122 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:34:03,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-09 07:34:03,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55. [2024-11-09 07:34:03,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 54 states have internal predecessors, (63), 0 states have call successors, (0), 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-11-09 07:34:03,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2024-11-09 07:34:03,281 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 15 [2024-11-09 07:34:03,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:03,281 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2024-11-09 07:34:03,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:03,281 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2024-11-09 07:34:03,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 07:34:03,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:03,282 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:03,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 07:34:03,282 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 07:34:03,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:03,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1758948201, now seen corresponding path program 1 times [2024-11-09 07:34:03,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:03,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708814300] [2024-11-09 07:34:03,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:03,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:03,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:03,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:03,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:03,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708814300] [2024-11-09 07:34:03,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708814300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:34:03,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:34:03,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:34:03,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819936842] [2024-11-09 07:34:03,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:34:03,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:34:03,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:03,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:34:03,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:34:03,316 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:03,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:03,345 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2024-11-09 07:34:03,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:34:03,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-09 07:34:03,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:03,346 INFO L225 Difference]: With dead ends: 55 [2024-11-09 07:34:03,346 INFO L226 Difference]: Without dead ends: 55 [2024-11-09 07:34:03,346 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-11-09 07:34:03,347 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:03,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 71 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:34:03,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-09 07:34:03,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2024-11-09 07:34:03,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 53 states have internal predecessors, (62), 0 states have call successors, (0), 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-11-09 07:34:03,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2024-11-09 07:34:03,348 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 17 [2024-11-09 07:34:03,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:03,348 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2024-11-09 07:34:03,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:03,349 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2024-11-09 07:34:03,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 07:34:03,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:03,349 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:03,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 07:34:03,349 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 07:34:03,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:03,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1758948202, now seen corresponding path program 1 times [2024-11-09 07:34:03,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:03,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530028731] [2024-11-09 07:34:03,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:03,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:03,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:03,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:03,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:03,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530028731] [2024-11-09 07:34:03,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530028731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:34:03,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:34:03,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:34:03,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192910242] [2024-11-09 07:34:03,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:34:03,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:34:03,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:03,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:34:03,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:34:03,447 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:03,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:03,507 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2024-11-09 07:34:03,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:34:03,507 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-09 07:34:03,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:03,507 INFO L225 Difference]: With dead ends: 68 [2024-11-09 07:34:03,507 INFO L226 Difference]: Without dead ends: 68 [2024-11-09 07:34:03,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:34:03,508 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 29 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:03,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 128 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:34:03,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-09 07:34:03,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 55. [2024-11-09 07:34:03,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 48 states have (on average 1.3125) internal successors, (63), 54 states have internal predecessors, (63), 0 states have call successors, (0), 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-11-09 07:34:03,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2024-11-09 07:34:03,510 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 17 [2024-11-09 07:34:03,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:03,510 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2024-11-09 07:34:03,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:03,511 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2024-11-09 07:34:03,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 07:34:03,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:03,511 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:03,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 07:34:03,511 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 07:34:03,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:03,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1867940585, now seen corresponding path program 1 times [2024-11-09 07:34:03,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:03,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433199143] [2024-11-09 07:34:03,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:03,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:03,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:03,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:03,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:03,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433199143] [2024-11-09 07:34:03,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433199143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:34:03,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:34:03,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:34:03,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222688801] [2024-11-09 07:34:03,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:34:03,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:34:03,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:03,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:34:03,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:34:03,550 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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-11-09 07:34:03,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:03,589 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2024-11-09 07:34:03,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:34:03,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-09 07:34:03,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:03,590 INFO L225 Difference]: With dead ends: 55 [2024-11-09 07:34:03,590 INFO L226 Difference]: Without dead ends: 55 [2024-11-09 07:34:03,590 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-11-09 07:34:03,591 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 9 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:03,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 99 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:34:03,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-09 07:34:03,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2024-11-09 07:34:03,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 53 states have internal predecessors, (62), 0 states have call successors, (0), 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-11-09 07:34:03,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2024-11-09 07:34:03,592 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 19 [2024-11-09 07:34:03,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:03,592 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2024-11-09 07:34:03,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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-11-09 07:34:03,593 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2024-11-09 07:34:03,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 07:34:03,593 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:03,593 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:03,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 07:34:03,593 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 07:34:03,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:03,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1867940584, now seen corresponding path program 1 times [2024-11-09 07:34:03,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:03,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068122423] [2024-11-09 07:34:03,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:03,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:03,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:03,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:03,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:03,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068122423] [2024-11-09 07:34:03,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068122423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:34:03,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:34:03,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:34:03,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023329449] [2024-11-09 07:34:03,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:34:03,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:34:03,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:03,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:34:03,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:34:03,746 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 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-11-09 07:34:03,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:03,841 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2024-11-09 07:34:03,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:34:03,842 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-09 07:34:03,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:03,842 INFO L225 Difference]: With dead ends: 66 [2024-11-09 07:34:03,842 INFO L226 Difference]: Without dead ends: 66 [2024-11-09 07:34:03,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:34:03,843 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 20 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:03,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 132 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:34:03,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-09 07:34:03,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2024-11-09 07:34:03,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 50 states have (on average 1.28) internal successors, (64), 55 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-11-09 07:34:03,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2024-11-09 07:34:03,845 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 19 [2024-11-09 07:34:03,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:03,845 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2024-11-09 07:34:03,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 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-11-09 07:34:03,845 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2024-11-09 07:34:03,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 07:34:03,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:03,845 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:03,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 07:34:03,846 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 07:34:03,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:03,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1867891817, now seen corresponding path program 1 times [2024-11-09 07:34:03,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:03,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623081498] [2024-11-09 07:34:03,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:03,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:03,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:03,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:03,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:03,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623081498] [2024-11-09 07:34:03,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623081498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:34:03,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:34:03,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:34:03,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793918393] [2024-11-09 07:34:03,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:34:03,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:34:03,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:03,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:34:03,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:34:03,972 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 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-11-09 07:34:04,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:04,013 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2024-11-09 07:34:04,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:34:04,013 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-09 07:34:04,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:04,014 INFO L225 Difference]: With dead ends: 74 [2024-11-09 07:34:04,014 INFO L226 Difference]: Without dead ends: 74 [2024-11-09 07:34:04,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:34:04,015 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 6 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:04,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 203 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:34:04,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-09 07:34:04,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2024-11-09 07:34:04,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 72 states have internal predecessors, (83), 0 states have call successors, (0), 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-11-09 07:34:04,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2024-11-09 07:34:04,016 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 19 [2024-11-09 07:34:04,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:04,016 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2024-11-09 07:34:04,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 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-11-09 07:34:04,017 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2024-11-09 07:34:04,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 07:34:04,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:04,017 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:04,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 07:34:04,017 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 07:34:04,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:04,018 INFO L85 PathProgramCache]: Analyzing trace with hash 838727577, now seen corresponding path program 1 times [2024-11-09 07:34:04,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:04,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192535232] [2024-11-09 07:34:04,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:04,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:04,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:04,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:04,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:04,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192535232] [2024-11-09 07:34:04,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192535232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:34:04,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:34:04,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 07:34:04,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429880693] [2024-11-09 07:34:04,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:34:04,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:34:04,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:04,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:34:04,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:34:04,153 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 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-11-09 07:34:04,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:04,216 INFO L93 Difference]: Finished difference Result 99 states and 113 transitions. [2024-11-09 07:34:04,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:34:04,216 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-09 07:34:04,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:04,217 INFO L225 Difference]: With dead ends: 99 [2024-11-09 07:34:04,217 INFO L226 Difference]: Without dead ends: 99 [2024-11-09 07:34:04,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:34:04,218 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 22 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:04,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 203 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:34:04,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-09 07:34:04,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 75. [2024-11-09 07:34:04,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 69 states have (on average 1.2608695652173914) internal successors, (87), 74 states have internal predecessors, (87), 0 states have call successors, (0), 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-11-09 07:34:04,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions. [2024-11-09 07:34:04,220 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 19 [2024-11-09 07:34:04,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:04,220 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions. [2024-11-09 07:34:04,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 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-11-09 07:34:04,220 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2024-11-09 07:34:04,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 07:34:04,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:04,220 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:04,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 07:34:04,221 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 07:34:04,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:04,221 INFO L85 PathProgramCache]: Analyzing trace with hash -2070072374, now seen corresponding path program 1 times [2024-11-09 07:34:04,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:04,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281879131] [2024-11-09 07:34:04,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:04,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:04,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:04,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:04,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:04,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281879131] [2024-11-09 07:34:04,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281879131] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:34:04,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:34:04,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:34:04,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386641881] [2024-11-09 07:34:04,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:34:04,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:34:04,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:04,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:34:04,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:34:04,291 INFO L87 Difference]: Start difference. First operand 75 states and 87 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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-11-09 07:34:04,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:04,308 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2024-11-09 07:34:04,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:34:04,308 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-09 07:34:04,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:04,309 INFO L225 Difference]: With dead ends: 74 [2024-11-09 07:34:04,309 INFO L226 Difference]: Without dead ends: 46 [2024-11-09 07:34:04,309 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-11-09 07:34:04,309 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 21 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 56 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-11-09 07:34:04,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 56 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:34:04,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-09 07:34:04,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-09 07:34:04,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 45 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:04,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2024-11-09 07:34:04,311 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 20 [2024-11-09 07:34:04,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:04,311 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2024-11-09 07:34:04,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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-11-09 07:34:04,311 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2024-11-09 07:34:04,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 07:34:04,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:04,311 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:04,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 07:34:04,311 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 07:34:04,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:04,312 INFO L85 PathProgramCache]: Analyzing trace with hash 719635548, now seen corresponding path program 1 times [2024-11-09 07:34:04,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:04,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79249331] [2024-11-09 07:34:04,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:04,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:04,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:04,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:04,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79249331] [2024-11-09 07:34:04,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79249331] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:34:04,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697845199] [2024-11-09 07:34:04,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:04,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:34:04,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:34:04,430 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:34:04,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 07:34:04,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:04,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 07:34:04,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:34:04,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:04,555 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:34:04,635 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-11-09 07:34:04,657 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:04,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697845199] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:34:04,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:34:04,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2024-11-09 07:34:04,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735765098] [2024-11-09 07:34:04,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:34:04,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 07:34:04,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:04,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 07:34:04,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2024-11-09 07:34:04,659 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 18 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 18 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:04,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:04,772 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2024-11-09 07:34:04,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 07:34:04,773 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 18 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-09 07:34:04,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:04,773 INFO L225 Difference]: With dead ends: 58 [2024-11-09 07:34:04,773 INFO L226 Difference]: Without dead ends: 58 [2024-11-09 07:34:04,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2024-11-09 07:34:04,774 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 28 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:04,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 161 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:34:04,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-09 07:34:04,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 47. [2024-11-09 07:34:04,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 43 states have (on average 1.186046511627907) internal successors, (51), 46 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:04,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2024-11-09 07:34:04,775 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 23 [2024-11-09 07:34:04,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:04,776 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2024-11-09 07:34:04,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 18 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:04,776 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2024-11-09 07:34:04,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 07:34:04,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:04,776 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:04,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 07:34:04,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:34:04,981 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 07:34:04,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:04,981 INFO L85 PathProgramCache]: Analyzing trace with hash 80027165, now seen corresponding path program 1 times [2024-11-09 07:34:04,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:04,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754583154] [2024-11-09 07:34:04,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:04,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:05,190 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:34:05,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:05,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754583154] [2024-11-09 07:34:05,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754583154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:34:05,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:34:05,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 07:34:05,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272682174] [2024-11-09 07:34:05,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:34:05,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 07:34:05,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:05,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 07:34:05,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:34:05,191 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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-11-09 07:34:05,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:05,250 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2024-11-09 07:34:05,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 07:34:05,250 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-09 07:34:05,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:05,250 INFO L225 Difference]: With dead ends: 57 [2024-11-09 07:34:05,251 INFO L226 Difference]: Without dead ends: 39 [2024-11-09 07:34:05,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:34:05,251 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:05,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 182 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:34:05,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-09 07:34:05,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-09 07:34:05,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 38 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:05,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2024-11-09 07:34:05,252 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 25 [2024-11-09 07:34:05,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:05,252 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2024-11-09 07:34:05,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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-11-09 07:34:05,252 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2024-11-09 07:34:05,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 07:34:05,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:05,255 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:05,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-09 07:34:05,255 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 07:34:05,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:05,256 INFO L85 PathProgramCache]: Analyzing trace with hash 298881883, now seen corresponding path program 1 times [2024-11-09 07:34:05,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:05,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432646698] [2024-11-09 07:34:05,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:05,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:05,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:05,638 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:34:05,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:05,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432646698] [2024-11-09 07:34:05,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432646698] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:34:05,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942779936] [2024-11-09 07:34:05,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:05,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:34:05,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:34:05,641 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:34:05,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 07:34:05,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:05,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-09 07:34:05,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:34:05,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:34:05,910 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:34:05,910 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:34:05,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942779936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:34:05,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:34:05,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [12] total 23 [2024-11-09 07:34:05,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113930028] [2024-11-09 07:34:05,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:34:05,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 07:34:05,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:05,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 07:34:05,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2024-11-09 07:34:05,912 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 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-11-09 07:34:05,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:05,986 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2024-11-09 07:34:05,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:34:05,987 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-09 07:34:05,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:05,987 INFO L225 Difference]: With dead ends: 53 [2024-11-09 07:34:05,987 INFO L226 Difference]: Without dead ends: 43 [2024-11-09 07:34:05,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2024-11-09 07:34:05,987 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 25 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:05,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 155 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:34:05,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-09 07:34:05,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2024-11-09 07:34:05,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 39 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-11-09 07:34:05,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2024-11-09 07:34:05,989 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 25 [2024-11-09 07:34:05,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:05,989 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2024-11-09 07:34:05,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 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-11-09 07:34:05,989 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2024-11-09 07:34:05,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 07:34:05,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:05,989 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:06,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 07:34:06,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-09 07:34:06,190 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 07:34:06,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:06,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1400223262, now seen corresponding path program 1 times [2024-11-09 07:34:06,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:06,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756586021] [2024-11-09 07:34:06,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:06,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:06,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:06,393 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:34:06,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:06,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756586021] [2024-11-09 07:34:06,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756586021] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:34:06,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774359050] [2024-11-09 07:34:06,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:06,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:34:06,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:34:06,394 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:34:06,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 07:34:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:06,459 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 07:34:06,460 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:34:06,541 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:34:06,542 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:34:06,642 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-11-09 07:34:06,665 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:34:06,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774359050] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:34:06,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:34:06,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2024-11-09 07:34:06,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730880340] [2024-11-09 07:34:06,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:34:06,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 07:34:06,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:06,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 07:34:06,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2024-11-09 07:34:06,667 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 21 states, 20 states have (on average 2.95) internal successors, (59), 21 states have internal predecessors, (59), 0 states have call successors, (0), 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-11-09 07:34:06,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:06,807 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2024-11-09 07:34:06,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 07:34:06,808 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.95) internal successors, (59), 21 states have internal predecessors, (59), 0 states have call successors, (0), 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 29 [2024-11-09 07:34:06,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:06,808 INFO L225 Difference]: With dead ends: 45 [2024-11-09 07:34:06,808 INFO L226 Difference]: Without dead ends: 45 [2024-11-09 07:34:06,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2024-11-09 07:34:06,809 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 11 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:06,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 169 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:34:06,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-09 07:34:06,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2024-11-09 07:34:06,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 41 states have internal predecessors, (44), 0 states have call successors, (0), 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-11-09 07:34:06,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2024-11-09 07:34:06,810 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 29 [2024-11-09 07:34:06,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:06,810 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2024-11-09 07:34:06,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.95) internal successors, (59), 21 states have internal predecessors, (59), 0 states have call successors, (0), 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-11-09 07:34:06,810 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2024-11-09 07:34:06,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 07:34:06,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:06,811 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:06,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 07:34:07,014 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,SelfDestructingSolverStorable27 [2024-11-09 07:34:07,015 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 07:34:07,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:07,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1289791583, now seen corresponding path program 1 times [2024-11-09 07:34:07,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:07,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851866032] [2024-11-09 07:34:07,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:07,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:07,085 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:34:07,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:07,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851866032] [2024-11-09 07:34:07,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851866032] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:34:07,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435010003] [2024-11-09 07:34:07,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:07,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:34:07,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:34:07,087 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:34:07,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 07:34:07,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:07,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 07:34:07,158 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:34:07,232 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:34:07,233 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:34:07,335 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-11-09 07:34:07,355 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:34:07,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435010003] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:34:07,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:34:07,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 15 [2024-11-09 07:34:07,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502046014] [2024-11-09 07:34:07,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:34:07,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 07:34:07,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:07,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 07:34:07,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2024-11-09 07:34:07,357 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand has 16 states, 15 states have (on average 4.533333333333333) internal successors, (68), 16 states have internal predecessors, (68), 0 states have call successors, (0), 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-11-09 07:34:07,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:07,512 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2024-11-09 07:34:07,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 07:34:07,512 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.533333333333333) internal successors, (68), 16 states have internal predecessors, (68), 0 states have call successors, (0), 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 31 [2024-11-09 07:34:07,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:07,513 INFO L225 Difference]: With dead ends: 41 [2024-11-09 07:34:07,513 INFO L226 Difference]: Without dead ends: 41 [2024-11-09 07:34:07,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2024-11-09 07:34:07,516 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 7 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:07,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 177 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:34:07,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-09 07:34:07,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-09 07:34:07,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 38 states have (on average 1.131578947368421) internal successors, (43), 40 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:07,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2024-11-09 07:34:07,518 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 31 [2024-11-09 07:34:07,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:07,519 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2024-11-09 07:34:07,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.533333333333333) internal successors, (68), 16 states have internal predecessors, (68), 0 states have call successors, (0), 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-11-09 07:34:07,519 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2024-11-09 07:34:07,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 07:34:07,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:07,520 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:07,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 07:34:07,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-09 07:34:07,721 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 07:34:07,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:07,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1755885363, now seen corresponding path program 1 times [2024-11-09 07:34:07,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:07,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091240789] [2024-11-09 07:34:07,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:07,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:07,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:07,924 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:34:07,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:07,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091240789] [2024-11-09 07:34:07,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091240789] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:34:07,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350709905] [2024-11-09 07:34:07,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:07,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:34:07,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:34:07,927 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:34:07,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 07:34:07,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:07,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 07:34:07,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:34:08,081 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:34:08,081 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:34:08,206 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-11-09 07:34:08,228 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:34:08,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350709905] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:34:08,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:34:08,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 22 [2024-11-09 07:34:08,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197400417] [2024-11-09 07:34:08,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:34:08,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 07:34:08,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:08,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 07:34:08,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2024-11-09 07:34:08,230 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand has 23 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:08,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:08,415 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2024-11-09 07:34:08,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:34:08,419 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-09 07:34:08,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:08,419 INFO L225 Difference]: With dead ends: 53 [2024-11-09 07:34:08,419 INFO L226 Difference]: Without dead ends: 50 [2024-11-09 07:34:08,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2024-11-09 07:34:08,420 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 16 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:08,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 261 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:34:08,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-09 07:34:08,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2024-11-09 07:34:08,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 41 states have internal predecessors, (44), 0 states have call successors, (0), 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-11-09 07:34:08,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2024-11-09 07:34:08,421 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 33 [2024-11-09 07:34:08,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:08,421 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2024-11-09 07:34:08,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:08,421 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2024-11-09 07:34:08,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 07:34:08,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:08,422 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:08,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 07:34:08,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:34:08,627 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 07:34:08,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:08,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1755836596, now seen corresponding path program 1 times [2024-11-09 07:34:08,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:08,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103655597] [2024-11-09 07:34:08,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:08,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:08,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:08,924 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:34:08,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:08,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103655597] [2024-11-09 07:34:08,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103655597] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:34:08,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649813546] [2024-11-09 07:34:08,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:08,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:34:08,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:34:08,926 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:34:08,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 07:34:08,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:08,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-09 07:34:08,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:34:09,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 07:34:09,095 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:34:09,095 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:34:09,132 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-11-09 07:34:09,133 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-11-09 07:34:09,176 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:34:09,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649813546] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:34:09,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:34:09,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 20 [2024-11-09 07:34:09,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421096114] [2024-11-09 07:34:09,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:34:09,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 07:34:09,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:09,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 07:34:09,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2024-11-09 07:34:09,178 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand has 20 states, 20 states have (on average 2.95) internal successors, (59), 20 states have internal predecessors, (59), 0 states have call successors, (0), 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-11-09 07:34:09,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:09,288 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2024-11-09 07:34:09,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:34:09,289 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.95) internal successors, (59), 20 states have internal predecessors, (59), 0 states have call successors, (0), 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 33 [2024-11-09 07:34:09,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:09,289 INFO L225 Difference]: With dead ends: 71 [2024-11-09 07:34:09,289 INFO L226 Difference]: Without dead ends: 49 [2024-11-09 07:34:09,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2024-11-09 07:34:09,290 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 8 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:09,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 268 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:34:09,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-09 07:34:09,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2024-11-09 07:34:09,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 45 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-11-09 07:34:09,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2024-11-09 07:34:09,291 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 33 [2024-11-09 07:34:09,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:09,291 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2024-11-09 07:34:09,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.95) internal successors, (59), 20 states have internal predecessors, (59), 0 states have call successors, (0), 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-11-09 07:34:09,291 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2024-11-09 07:34:09,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 07:34:09,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:09,291 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:09,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 07:34:09,492 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,SelfDestructingSolverStorable30 [2024-11-09 07:34:09,493 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 07:34:09,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:09,493 INFO L85 PathProgramCache]: Analyzing trace with hash -915276849, now seen corresponding path program 2 times [2024-11-09 07:34:09,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:09,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057646228] [2024-11-09 07:34:09,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:09,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:09,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:09,669 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:34:09,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:09,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057646228] [2024-11-09 07:34:09,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057646228] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:34:09,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30974742] [2024-11-09 07:34:09,670 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:34:09,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:34:09,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:34:09,671 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:34:09,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 07:34:09,748 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:34:09,748 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:34:09,750 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 07:34:09,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:34:09,854 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:34:09,854 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:34:09,971 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-11-09 07:34:10,008 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:34:10,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30974742] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:34:10,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:34:10,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2024-11-09 07:34:10,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334464702] [2024-11-09 07:34:10,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:34:10,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 07:34:10,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:10,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 07:34:10,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2024-11-09 07:34:10,011 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand has 21 states, 20 states have (on average 3.9) internal successors, (78), 21 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-11-09 07:34:10,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:10,182 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2024-11-09 07:34:10,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 07:34:10,182 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.9) internal successors, (78), 21 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) Word has length 37 [2024-11-09 07:34:10,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:10,183 INFO L225 Difference]: With dead ends: 54 [2024-11-09 07:34:10,183 INFO L226 Difference]: Without dead ends: 54 [2024-11-09 07:34:10,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2024-11-09 07:34:10,184 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 12 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:10,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 206 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:34:10,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-09 07:34:10,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2024-11-09 07:34:10,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 46 states have (on average 1.108695652173913) internal successors, (51), 48 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:10,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2024-11-09 07:34:10,185 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 37 [2024-11-09 07:34:10,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:10,185 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2024-11-09 07:34:10,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.9) internal successors, (78), 21 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-11-09 07:34:10,186 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2024-11-09 07:34:10,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 07:34:10,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:10,186 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:10,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-09 07:34:10,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:34:10,391 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 07:34:10,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:10,391 INFO L85 PathProgramCache]: Analyzing trace with hash 887243984, now seen corresponding path program 2 times [2024-11-09 07:34:10,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:10,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144040375] [2024-11-09 07:34:10,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:10,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:10,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:10,816 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 07:34:10,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:10,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144040375] [2024-11-09 07:34:10,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144040375] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:34:10,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249556870] [2024-11-09 07:34:10,817 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:34:10,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:34:10,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:34:10,818 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:34:10,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 07:34:10,897 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:34:10,897 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:34:10,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-09 07:34:10,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:34:10,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 07:34:11,092 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 07:34:11,092 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:34:11,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2024-11-09 07:34:11,172 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-11-09 07:34:11,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2024-11-09 07:34:11,229 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 07:34:11,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249556870] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:34:11,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:34:11,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 14] total 34 [2024-11-09 07:34:11,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473734471] [2024-11-09 07:34:11,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:34:11,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-09 07:34:11,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:11,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-09 07:34:11,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1012, Unknown=0, NotChecked=0, Total=1122 [2024-11-09 07:34:11,230 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand has 34 states, 34 states have (on average 2.088235294117647) internal successors, (71), 34 states have internal predecessors, (71), 0 states have call successors, (0), 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-11-09 07:34:11,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:11,439 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2024-11-09 07:34:11,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 07:34:11,440 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.088235294117647) internal successors, (71), 34 states have internal predecessors, (71), 0 states have call successors, (0), 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 39 [2024-11-09 07:34:11,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:11,440 INFO L225 Difference]: With dead ends: 72 [2024-11-09 07:34:11,440 INFO L226 Difference]: Without dead ends: 56 [2024-11-09 07:34:11,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=1202, Unknown=0, NotChecked=0, Total=1332 [2024-11-09 07:34:11,441 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 23 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:11,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 260 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:34:11,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-09 07:34:11,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2024-11-09 07:34:11,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 50 states have (on average 1.1) internal successors, (55), 52 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:11,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2024-11-09 07:34:11,442 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 39 [2024-11-09 07:34:11,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:11,442 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2024-11-09 07:34:11,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.088235294117647) internal successors, (71), 34 states have internal predecessors, (71), 0 states have call successors, (0), 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-11-09 07:34:11,442 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2024-11-09 07:34:11,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 07:34:11,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:11,442 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:11,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-09 07:34:11,644 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,SelfDestructingSolverStorable32 [2024-11-09 07:34:11,644 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 07:34:11,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:11,645 INFO L85 PathProgramCache]: Analyzing trace with hash -290359725, now seen corresponding path program 3 times [2024-11-09 07:34:11,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:11,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249013971] [2024-11-09 07:34:11,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:11,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:11,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:11,895 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 07:34:11,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:11,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249013971] [2024-11-09 07:34:11,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249013971] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:34:11,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296256107] [2024-11-09 07:34:11,896 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 07:34:11,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:34:11,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:34:11,897 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:34:11,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 07:34:11,992 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 07:34:11,992 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:34:11,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 07:34:11,996 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:34:11,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 07:34:12,131 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 07:34:12,132 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:34:12,351 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 07:34:12,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296256107] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:34:12,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:34:12,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2024-11-09 07:34:12,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520693021] [2024-11-09 07:34:12,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:34:12,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-09 07:34:12,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:12,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-09 07:34:12,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=759, Unknown=0, NotChecked=0, Total=870 [2024-11-09 07:34:12,353 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand has 30 states, 29 states have (on average 3.5517241379310347) internal successors, (103), 30 states have internal predecessors, (103), 0 states have call successors, (0), 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-11-09 07:34:12,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:12,551 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2024-11-09 07:34:12,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 07:34:12,551 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.5517241379310347) internal successors, (103), 30 states have internal predecessors, (103), 0 states have call successors, (0), 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 43 [2024-11-09 07:34:12,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:12,552 INFO L225 Difference]: With dead ends: 55 [2024-11-09 07:34:12,552 INFO L226 Difference]: Without dead ends: 55 [2024-11-09 07:34:12,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=914, Unknown=0, NotChecked=0, Total=1056 [2024-11-09 07:34:12,552 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:12,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 238 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:34:12,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-09 07:34:12,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-09 07:34:12,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 54 states have internal predecessors, (57), 0 states have call successors, (0), 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-11-09 07:34:12,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2024-11-09 07:34:12,553 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 43 [2024-11-09 07:34:12,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:12,553 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2024-11-09 07:34:12,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.5517241379310347) internal successors, (103), 30 states have internal predecessors, (103), 0 states have call successors, (0), 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-11-09 07:34:12,554 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2024-11-09 07:34:12,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 07:34:12,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:12,554 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:12,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-09 07:34:12,754 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,SelfDestructingSolverStorable33 [2024-11-09 07:34:12,754 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 07:34:12,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:12,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1315049854, now seen corresponding path program 2 times [2024-11-09 07:34:12,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:12,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897993334] [2024-11-09 07:34:12,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:12,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:12,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:13,036 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 07:34:13,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:13,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897993334] [2024-11-09 07:34:13,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897993334] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:34:13,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725240623] [2024-11-09 07:34:13,037 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:34:13,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:34:13,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:34:13,038 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:34:13,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 07:34:13,111 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 07:34:13,112 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:34:13,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 07:34:13,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:34:13,164 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 07:34:13,164 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:34:13,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725240623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:34:13,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:34:13,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 15 [2024-11-09 07:34:13,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631999936] [2024-11-09 07:34:13,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:34:13,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:34:13,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:13,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:34:13,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2024-11-09 07:34:13,165 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:13,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:13,192 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2024-11-09 07:34:13,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:34:13,192 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-09 07:34:13,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:13,193 INFO L225 Difference]: With dead ends: 54 [2024-11-09 07:34:13,193 INFO L226 Difference]: Without dead ends: 51 [2024-11-09 07:34:13,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2024-11-09 07:34:13,193 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 5 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:13,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 78 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:34:13,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-09 07:34:13,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-09 07:34:13,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 50 states have internal predecessors, (53), 0 states have call successors, (0), 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-11-09 07:34:13,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2024-11-09 07:34:13,194 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 47 [2024-11-09 07:34:13,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:13,194 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2024-11-09 07:34:13,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:13,195 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2024-11-09 07:34:13,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 07:34:13,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:13,195 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:13,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-09 07:34:13,399 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,SelfDestructingSolverStorable34 [2024-11-09 07:34:13,399 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 07:34:13,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:13,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1315001087, now seen corresponding path program 3 times [2024-11-09 07:34:13,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:13,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871845326] [2024-11-09 07:34:13,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:13,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:13,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:13,662 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 07:34:13,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:13,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871845326] [2024-11-09 07:34:13,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871845326] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:34:13,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315104852] [2024-11-09 07:34:13,662 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 07:34:13,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:34:13,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:34:13,664 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:34:13,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-09 07:34:13,755 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-09 07:34:13,755 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:34:13,757 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 93 conjuncts are in the unsatisfiable core [2024-11-09 07:34:13,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:34:14,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:34:14,284 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:14,285 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:34:14,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2024-11-09 07:34:14,464 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-11-09 07:34:14,466 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-11-09 07:34:14,586 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 07:34:14,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315104852] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:34:14,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:34:14,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 23, 16] total 46 [2024-11-09 07:34:14,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723537224] [2024-11-09 07:34:14,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:34:14,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-09 07:34:14,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:14,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-09 07:34:14,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1933, Unknown=0, NotChecked=0, Total=2070 [2024-11-09 07:34:14,588 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand has 46 states, 46 states have (on average 2.608695652173913) internal successors, (120), 46 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-11-09 07:34:15,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:15,354 INFO L93 Difference]: Finished difference Result 145 states and 150 transitions. [2024-11-09 07:34:15,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-11-09 07:34:15,355 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.608695652173913) internal successors, (120), 46 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 47 [2024-11-09 07:34:15,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:15,355 INFO L225 Difference]: With dead ends: 145 [2024-11-09 07:34:15,355 INFO L226 Difference]: Without dead ends: 65 [2024-11-09 07:34:15,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 926 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=308, Invalid=4384, Unknown=0, NotChecked=0, Total=4692 [2024-11-09 07:34:15,357 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 47 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 1242 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 1248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:15,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 439 Invalid, 1248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1242 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:34:15,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-09 07:34:15,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2024-11-09 07:34:15,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 57 states have (on average 1.0701754385964912) internal successors, (61), 58 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-11-09 07:34:15,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2024-11-09 07:34:15,358 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 47 [2024-11-09 07:34:15,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:15,358 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2024-11-09 07:34:15,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.608695652173913) internal successors, (120), 46 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-11-09 07:34:15,358 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2024-11-09 07:34:15,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 07:34:15,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:15,358 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:15,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-09 07:34:15,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-09 07:34:15,562 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 07:34:15,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:15,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1294426809, now seen corresponding path program 4 times [2024-11-09 07:34:15,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:15,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843826273] [2024-11-09 07:34:15,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:15,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:15,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:15,774 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 07:34:15,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:15,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843826273] [2024-11-09 07:34:15,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843826273] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:34:15,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724347654] [2024-11-09 07:34:15,775 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 07:34:15,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:34:15,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:34:15,777 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:34:15,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-09 07:34:15,864 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 07:34:15,864 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:34:15,865 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-09 07:34:15,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:34:15,903 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-11-09 07:34:16,918 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-11-09 07:34:17,061 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-11-09 07:34:17,062 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-11-09 07:34:17,118 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 15 proven. 5 refuted. 1 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 07:34:17,118 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:34:17,238 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 8 treesize of output 4 [2024-11-09 07:34:17,615 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-11-09 07:34:17,621 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 68 treesize of output 58 [2024-11-09 07:34:17,631 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-11-09 07:34:17,665 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 07:34:17,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724347654] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:34:17,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:34:17,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 35 [2024-11-09 07:34:17,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44086726] [2024-11-09 07:34:17,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:34:17,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-09 07:34:17,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:17,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-09 07:34:17,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1089, Unknown=1, NotChecked=0, Total=1260 [2024-11-09 07:34:17,667 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand has 36 states, 35 states have (on average 3.0) internal successors, (105), 36 states have internal predecessors, (105), 0 states have call successors, (0), 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-11-09 07:34:18,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:18,386 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2024-11-09 07:34:18,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-09 07:34:18,386 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.0) internal successors, (105), 36 states have internal predecessors, (105), 0 states have call successors, (0), 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 55 [2024-11-09 07:34:18,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:18,387 INFO L225 Difference]: With dead ends: 61 [2024-11-09 07:34:18,387 INFO L226 Difference]: Without dead ends: 61 [2024-11-09 07:34:18,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=389, Invalid=2472, Unknown=1, NotChecked=0, Total=2862 [2024-11-09 07:34:18,388 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 13 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:18,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 315 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:34:18,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-09 07:34:18,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2024-11-09 07:34:18,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 57 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-11-09 07:34:18,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2024-11-09 07:34:18,389 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 55 [2024-11-09 07:34:18,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:18,389 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2024-11-09 07:34:18,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.0) internal successors, (105), 36 states have internal predecessors, (105), 0 states have call successors, (0), 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-11-09 07:34:18,389 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2024-11-09 07:34:18,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-09 07:34:18,389 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:18,389 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:18,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-09 07:34:18,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:34:18,593 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-09 07:34:18,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:18,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1596352584, now seen corresponding path program 4 times [2024-11-09 07:34:18,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:18,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218743965] [2024-11-09 07:34:18,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:18,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:18,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:18,887 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 41 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 07:34:18,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:18,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218743965] [2024-11-09 07:34:18,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218743965] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:34:18,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332652688] [2024-11-09 07:34:18,889 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 07:34:18,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:34:18,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:34:18,890 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-11-09 07:34:18,891 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-11-09 07:34:18,978 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 07:34:18,979 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:34:18,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 96 conjuncts are in the unsatisfiable core [2024-11-09 07:34:18,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:34:19,021 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-11-09 07:34:20,406 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-11-09 07:34:20,407 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 50 treesize of output 49 [2024-11-09 07:34:20,533 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:34:20,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 27 [2024-11-09 07:34:20,576 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 11 proven. 15 refuted. 1 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 07:34:20,577 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:34:21,497 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:34:21,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 38 [2024-11-09 07:34:21,669 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-11-09 07:34:21,673 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 68 treesize of output 58 [2024-11-09 07:34:21,678 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-11-09 07:34:21,706 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 07:34:21,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332652688] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:34:21,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:34:21,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 23, 23] total 54 [2024-11-09 07:34:21,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108761530] [2024-11-09 07:34:21,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:34:21,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-11-09 07:34:21,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:21,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-11-09 07:34:21,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=2654, Unknown=1, NotChecked=0, Total=2970 [2024-11-09 07:34:21,707 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand has 55 states, 54 states have (on average 1.9814814814814814) internal successors, (107), 55 states have internal predecessors, (107), 0 states have call successors, (0), 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-11-09 07:34:23,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:23,295 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2024-11-09 07:34:23,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-09 07:34:23,295 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 1.9814814814814814) internal successors, (107), 55 states have internal predecessors, (107), 0 states have call successors, (0), 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 57 [2024-11-09 07:34:23,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:23,295 INFO L225 Difference]: With dead ends: 60 [2024-11-09 07:34:23,295 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 07:34:23,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1565 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=808, Invalid=6331, Unknown=1, NotChecked=0, Total=7140 [2024-11-09 07:34:23,296 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 3 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:23,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 369 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 947 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 07:34:23,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 07:34:23,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 07:34:23,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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-11-09 07:34:23,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 07:34:23,297 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2024-11-09 07:34:23,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:23,297 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 07:34:23,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 1.9814814814814814) internal successors, (107), 55 states have internal predecessors, (107), 0 states have call successors, (0), 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-11-09 07:34:23,297 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 07:34:23,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 07:34:23,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 19 remaining) [2024-11-09 07:34:23,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 19 remaining) [2024-11-09 07:34:23,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 19 remaining) [2024-11-09 07:34:23,301 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 19 remaining) [2024-11-09 07:34:23,301 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 19 remaining) [2024-11-09 07:34:23,301 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 19 remaining) [2024-11-09 07:34:23,301 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 19 remaining) [2024-11-09 07:34:23,301 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 19 remaining) [2024-11-09 07:34:23,301 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 19 remaining) [2024-11-09 07:34:23,301 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 19 remaining) [2024-11-09 07:34:23,301 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 19 remaining) [2024-11-09 07:34:23,301 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 19 remaining) [2024-11-09 07:34:23,301 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 19 remaining) [2024-11-09 07:34:23,301 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 19 remaining) [2024-11-09 07:34:23,301 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 19 remaining) [2024-11-09 07:34:23,301 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 19 remaining) [2024-11-09 07:34:23,301 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 19 remaining) [2024-11-09 07:34:23,301 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 19 remaining) [2024-11-09 07:34:23,301 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK (0 of 19 remaining) [2024-11-09 07:34:23,314 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-11-09 07:34:23,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-11-09 07:34:23,508 INFO L407 BasicCegarLoop]: Path program histogram: [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:23,509 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 07:34:23,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:34:23 BoogieIcfgContainer [2024-11-09 07:34:23,512 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 07:34:23,512 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 07:34:23,512 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 07:34:23,512 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 07:34:23,512 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:33:58" (3/4) ... [2024-11-09 07:34:23,514 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 07:34:23,520 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-09 07:34:23,520 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 07:34:23,520 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-09 07:34:23,521 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 07:34:23,590 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 07:34:23,591 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 07:34:23,591 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 07:34:23,591 INFO L158 Benchmark]: Toolchain (without parser) took 25578.27ms. Allocated memory was 163.6MB in the beginning and 388.0MB in the end (delta: 224.4MB). Free memory was 90.7MB in the beginning and 292.6MB in the end (delta: -201.9MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. [2024-11-09 07:34:23,591 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 163.6MB. Free memory is still 117.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:34:23,591 INFO L158 Benchmark]: CACSL2BoogieTranslator took 409.20ms. Allocated memory is still 163.6MB. Free memory was 90.5MB in the beginning and 127.2MB in the end (delta: -36.7MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. [2024-11-09 07:34:23,591 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.81ms. Allocated memory is still 163.6MB. Free memory was 127.2MB in the beginning and 126.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:34:23,592 INFO L158 Benchmark]: Boogie Preprocessor took 43.26ms. Allocated memory is still 163.6MB. Free memory was 125.1MB in the beginning and 123.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:34:23,592 INFO L158 Benchmark]: RCFGBuilder took 318.00ms. Allocated memory is still 163.6MB. Free memory was 123.0MB in the beginning and 106.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 07:34:23,592 INFO L158 Benchmark]: TraceAbstraction took 24687.00ms. Allocated memory was 163.6MB in the beginning and 388.0MB in the end (delta: 224.4MB). Free memory was 105.2MB in the beginning and 297.4MB in the end (delta: -192.2MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. [2024-11-09 07:34:23,592 INFO L158 Benchmark]: Witness Printer took 78.81ms. Allocated memory is still 388.0MB. Free memory was 297.4MB in the beginning and 292.6MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 07:34:23,593 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 163.6MB. Free memory is still 117.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 409.20ms. Allocated memory is still 163.6MB. Free memory was 90.5MB in the beginning and 127.2MB in the end (delta: -36.7MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.81ms. Allocated memory is still 163.6MB. Free memory was 127.2MB in the beginning and 126.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.26ms. Allocated memory is still 163.6MB. Free memory was 125.1MB in the beginning and 123.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 318.00ms. Allocated memory is still 163.6MB. Free memory was 123.0MB in the beginning and 106.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 24687.00ms. Allocated memory was 163.6MB in the beginning and 388.0MB in the end (delta: 224.4MB). Free memory was 105.2MB in the beginning and 297.4MB in the end (delta: -192.2MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. * Witness Printer took 78.81ms. Allocated memory is still 388.0MB. Free memory was 297.4MB in the beginning and 292.6MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 521]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 51 locations, 19 error locations. Started 1 CEGAR loops. OverallTime: 24.6s, OverallIterations: 38, TraceHistogramMax: 4, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 669 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 669 mSDsluCounter, 6017 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4834 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6912 IncrementalHoareTripleChecker+Invalid, 6977 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 1183 mSDtfsCounter, 6912 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1328 GetRequests, 762 SyntacticMatches, 16 SemanticMatches, 550 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4458 ImplicationChecksByTransitivity, 9.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=9, InterpolantAutomatonStates: 382, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 38 MinimizatonAttempts, 180 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 13.6s InterpolantComputationTime, 1361 NumberOfCodeBlocks, 1317 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 1746 ConstructedInterpolants, 40 QuantifiedInterpolants, 14961 SizeOfPredicates, 103 NumberOfNonLiveVariables, 2577 ConjunctsInSsa, 577 ConjunctsInUnsatCore, 66 InterpolantComputations, 25 PerfectInterpolantSequences, 329/766 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 19 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-09 07:34:23,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE